./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5ac72ff2379990464c5f55660be1e08b12557a61aceeef8401296ef66be035fc --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 13:48:54,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:48:54,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:48:54,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:48:54,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:48:54,542 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:48:54,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:48:54,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:48:54,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:48:54,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:48:54,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:48:54,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:48:54,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:48:54,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:48:54,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:48:54,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:48:54,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:48:54,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:48:54,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:48:54,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:48:54,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:48:54,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:48:54,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:48:54,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:48:54,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:48:54,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:48:54,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:48:54,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:48:54,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:48:54,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:48:54,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:48:54,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:48:54,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:48:54,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:48:54,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:48:54,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:48:54,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:48:54,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:48:54,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:48:54,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:48:54,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:48:54,619 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-21 13:48:54,641 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:48:54,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:48:54,641 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:48:54,641 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:48:54,642 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:48:54,642 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:48:54,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:48:54,643 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:48:54,643 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:48:54,644 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:48:54,644 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:48:54,644 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:48:54,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:48:54,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:48:54,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:48:54,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 13:48:54,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:48:54,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 13:48:54,646 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-21 13:48:54,646 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:48:54,646 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 13:48:54,646 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:48:54,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 13:48:54,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:48:54,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:48:54,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:48:54,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:48:54,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:48:54,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:48:54,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 13:48:54,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:48:54,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:48:54,649 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 13:48:54,649 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 13:48:54,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 13:48:54,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5ac72ff2379990464c5f55660be1e08b12557a61aceeef8401296ef66be035fc [2022-11-21 13:48:54,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:48:54,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:48:54,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:48:54,966 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:48:54,967 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:48:54,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i [2022-11-21 13:48:58,009 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:48:58,386 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:48:58,386 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i [2022-11-21 13:48:58,407 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/data/31bf709cb/07cf3c89cfd647e4946ffa2bfd465623/FLAG337819343 [2022-11-21 13:48:58,429 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/data/31bf709cb/07cf3c89cfd647e4946ffa2bfd465623 [2022-11-21 13:48:58,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:48:58,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:48:58,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:48:58,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:48:58,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:48:58,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:48:58" (1/1) ... [2022-11-21 13:48:58,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377a4ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:58, skipping insertion in model container [2022-11-21 13:48:58,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:48:58" (1/1) ... [2022-11-21 13:48:58,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:48:58,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:48:59,104 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i[47038,47051] [2022-11-21 13:48:59,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:48:59,142 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:48:59,181 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i[47038,47051] [2022-11-21 13:48:59,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:48:59,252 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:48:59,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:59 WrapperNode [2022-11-21 13:48:59,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:48:59,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:48:59,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:48:59,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:48:59,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:59" (1/1) ... [2022-11-21 13:48:59,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:59" (1/1) ... [2022-11-21 13:48:59,328 INFO L138 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 217 [2022-11-21 13:48:59,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:48:59,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:48:59,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:48:59,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:48:59,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:59" (1/1) ... [2022-11-21 13:48:59,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:59" (1/1) ... [2022-11-21 13:48:59,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:59" (1/1) ... [2022-11-21 13:48:59,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:59" (1/1) ... [2022-11-21 13:48:59,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:59" (1/1) ... [2022-11-21 13:48:59,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:59" (1/1) ... [2022-11-21 13:48:59,362 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:59" (1/1) ... [2022-11-21 13:48:59,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:59" (1/1) ... [2022-11-21 13:48:59,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:48:59,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:48:59,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:48:59,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:48:59,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:59" (1/1) ... [2022-11-21 13:48:59,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:48:59,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:48:59,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:48:59,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:48:59,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:48:59,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:48:59,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 13:48:59,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 13:48:59,457 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-21 13:48:59,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:48:59,459 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-21 13:48:59,461 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-21 13:48:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:48:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:48:59,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:48:59,463 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 13:48:59,687 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:48:59,689 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:49:00,111 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:49:00,119 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:49:00,128 INFO L300 CfgBuilder]: Removed 22 assume(true) statements. [2022-11-21 13:49:00,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:49:00 BoogieIcfgContainer [2022-11-21 13:49:00,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:49:00,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:49:00,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:49:00,142 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:49:00,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:48:58" (1/3) ... [2022-11-21 13:49:00,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d876402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:49:00, skipping insertion in model container [2022-11-21 13:49:00,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:59" (2/3) ... [2022-11-21 13:49:00,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d876402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:49:00, skipping insertion in model container [2022-11-21 13:49:00,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:49:00" (3/3) ... [2022-11-21 13:49:00,158 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_79-equ_racefree.i [2022-11-21 13:49:00,167 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 13:49:00,193 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:49:00,194 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-21 13:49:00,194 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 13:49:00,321 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-21 13:49:00,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 236 transitions, 480 flow [2022-11-21 13:49:00,508 INFO L130 PetriNetUnfolder]: 43/315 cut-off events. [2022-11-21 13:49:00,508 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-21 13:49:00,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 315 events. 43/315 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1027 event pairs, 0 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 153. Up to 8 conditions per place. [2022-11-21 13:49:00,519 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 236 transitions, 480 flow [2022-11-21 13:49:00,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 231 transitions, 470 flow [2022-11-21 13:49:00,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:49:00,563 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7202638b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:49:00,563 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-21 13:49:00,592 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-21 13:49:00,593 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 13:49:00,593 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:00,594 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:00,594 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-21 13:49:00,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:00,602 INFO L85 PathProgramCache]: Analyzing trace with hash 687608078, now seen corresponding path program 1 times [2022-11-21 13:49:00,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:00,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142873414] [2022-11-21 13:49:00,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:00,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:01,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:01,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142873414] [2022-11-21 13:49:01,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142873414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:01,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:01,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:49:01,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082369307] [2022-11-21 13:49:01,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:01,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:49:01,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:01,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:49:01,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:49:01,171 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 236 [2022-11-21 13:49:01,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 231 transitions, 470 flow. Second operand has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:01,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:01,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 236 [2022-11-21 13:49:01,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:01,431 INFO L130 PetriNetUnfolder]: 6/473 cut-off events. [2022-11-21 13:49:01,431 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-21 13:49:01,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 473 events. 6/473 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2316 event pairs, 0 based on Foata normal form. 74/493 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2022-11-21 13:49:01,441 INFO L137 encePairwiseOnDemand]: 203/236 looper letters, 11 selfloop transitions, 8 changer transitions 0/206 dead transitions. [2022-11-21 13:49:01,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 206 transitions, 464 flow [2022-11-21 13:49:01,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:49:01,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-21 13:49:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1596 transitions. [2022-11-21 13:49:01,468 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8453389830508474 [2022-11-21 13:49:01,468 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1596 transitions. [2022-11-21 13:49:01,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1596 transitions. [2022-11-21 13:49:01,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:01,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1596 transitions. [2022-11-21 13:49:01,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 199.5) internal successors, (1596), 8 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:01,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:01,500 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:01,502 INFO L175 Difference]: Start difference. First operand has 207 places, 231 transitions, 470 flow. Second operand 8 states and 1596 transitions. [2022-11-21 13:49:01,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 206 transitions, 464 flow [2022-11-21 13:49:01,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 206 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 13:49:01,513 INFO L231 Difference]: Finished difference. Result has 211 places, 204 transitions, 432 flow [2022-11-21 13:49:01,516 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=432, PETRI_PLACES=211, PETRI_TRANSITIONS=204} [2022-11-21 13:49:01,520 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 4 predicate places. [2022-11-21 13:49:01,520 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 204 transitions, 432 flow [2022-11-21 13:49:01,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:01,521 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:01,522 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:01,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:49:01,522 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-21 13:49:01,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:01,523 INFO L85 PathProgramCache]: Analyzing trace with hash 687598048, now seen corresponding path program 1 times [2022-11-21 13:49:01,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:01,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983890484] [2022-11-21 13:49:01,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:01,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:01,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:01,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983890484] [2022-11-21 13:49:01,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983890484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:01,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:01,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:49:01,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324495639] [2022-11-21 13:49:01,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:01,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:49:01,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:01,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:49:01,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:49:01,695 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 236 [2022-11-21 13:49:01,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 204 transitions, 432 flow. Second operand has 4 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:01,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:01,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 236 [2022-11-21 13:49:01,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:01,847 INFO L130 PetriNetUnfolder]: 6/472 cut-off events. [2022-11-21 13:49:01,847 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-21 13:49:01,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 472 events. 6/472 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2312 event pairs, 0 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 223. Up to 12 conditions per place. [2022-11-21 13:49:01,851 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 11 selfloop transitions, 4 changer transitions 0/203 dead transitions. [2022-11-21 13:49:01,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 203 transitions, 460 flow [2022-11-21 13:49:01,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:49:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 13:49:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 981 transitions. [2022-11-21 13:49:01,854 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8313559322033899 [2022-11-21 13:49:01,854 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 981 transitions. [2022-11-21 13:49:01,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 981 transitions. [2022-11-21 13:49:01,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:01,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 981 transitions. [2022-11-21 13:49:01,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 196.2) internal successors, (981), 5 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:01,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:01,861 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:01,861 INFO L175 Difference]: Start difference. First operand has 211 places, 204 transitions, 432 flow. Second operand 5 states and 981 transitions. [2022-11-21 13:49:01,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 203 transitions, 460 flow [2022-11-21 13:49:01,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 203 transitions, 444 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-21 13:49:01,866 INFO L231 Difference]: Finished difference. Result has 207 places, 203 transitions, 422 flow [2022-11-21 13:49:01,867 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2022-11-21 13:49:01,868 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2022-11-21 13:49:01,868 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 422 flow [2022-11-21 13:49:01,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:01,869 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:01,869 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:01,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:49:01,869 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-21 13:49:01,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:01,870 INFO L85 PathProgramCache]: Analyzing trace with hash -158985636, now seen corresponding path program 1 times [2022-11-21 13:49:01,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:01,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903480241] [2022-11-21 13:49:01,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:01,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:01,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:01,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903480241] [2022-11-21 13:49:01,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903480241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:01,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:01,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:49:01,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720991498] [2022-11-21 13:49:01,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:01,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:49:01,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:01,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:49:01,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:49:01,969 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 236 [2022-11-21 13:49:01,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 422 flow. Second operand has 5 states, 5 states have (on average 192.8) internal successors, (964), 5 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:01,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:01,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 236 [2022-11-21 13:49:01,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:02,103 INFO L130 PetriNetUnfolder]: 6/471 cut-off events. [2022-11-21 13:49:02,103 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-21 13:49:02,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 471 events. 6/471 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2308 event pairs, 0 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 276. Up to 8 conditions per place. [2022-11-21 13:49:02,107 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 12 selfloop transitions, 6 changer transitions 0/204 dead transitions. [2022-11-21 13:49:02,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 204 transitions, 466 flow [2022-11-21 13:49:02,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:49:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 13:49:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1165 transitions. [2022-11-21 13:49:02,111 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8227401129943502 [2022-11-21 13:49:02,111 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1165 transitions. [2022-11-21 13:49:02,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1165 transitions. [2022-11-21 13:49:02,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:02,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1165 transitions. [2022-11-21 13:49:02,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 194.16666666666666) internal successors, (1165), 6 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:02,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:02,118 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:02,119 INFO L175 Difference]: Start difference. First operand has 207 places, 203 transitions, 422 flow. Second operand 6 states and 1165 transitions. [2022-11-21 13:49:02,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 204 transitions, 466 flow [2022-11-21 13:49:02,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 204 transitions, 458 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 13:49:02,123 INFO L231 Difference]: Finished difference. Result has 207 places, 202 transitions, 424 flow [2022-11-21 13:49:02,124 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=424, PETRI_PLACES=207, PETRI_TRANSITIONS=202} [2022-11-21 13:49:02,124 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2022-11-21 13:49:02,125 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 202 transitions, 424 flow [2022-11-21 13:49:02,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.8) internal successors, (964), 5 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:02,126 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:02,126 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:02,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 13:49:02,126 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-21 13:49:02,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:02,127 INFO L85 PathProgramCache]: Analyzing trace with hash -159296487, now seen corresponding path program 1 times [2022-11-21 13:49:02,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:02,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030752765] [2022-11-21 13:49:02,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:02,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:02,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:02,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030752765] [2022-11-21 13:49:02,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030752765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:02,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:02,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:49:02,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950688058] [2022-11-21 13:49:02,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:02,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:49:02,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:02,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:49:02,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:49:02,187 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 236 [2022-11-21 13:49:02,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 202 transitions, 424 flow. Second operand has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:02,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:02,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 236 [2022-11-21 13:49:02,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:02,277 INFO L130 PetriNetUnfolder]: 6/470 cut-off events. [2022-11-21 13:49:02,278 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-21 13:49:02,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 470 events. 6/470 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2313 event pairs, 0 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 218. Up to 9 conditions per place. [2022-11-21 13:49:02,282 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 13 selfloop transitions, 3 changer transitions 0/203 dead transitions. [2022-11-21 13:49:02,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 203 transitions, 464 flow [2022-11-21 13:49:02,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:49:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-21 13:49:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 789 transitions. [2022-11-21 13:49:02,284 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8358050847457628 [2022-11-21 13:49:02,284 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 789 transitions. [2022-11-21 13:49:02,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 789 transitions. [2022-11-21 13:49:02,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:02,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 789 transitions. [2022-11-21 13:49:02,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.25) internal successors, (789), 4 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:02,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:02,290 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:02,290 INFO L175 Difference]: Start difference. First operand has 207 places, 202 transitions, 424 flow. Second operand 4 states and 789 transitions. [2022-11-21 13:49:02,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 203 transitions, 464 flow [2022-11-21 13:49:02,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 203 transitions, 452 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-21 13:49:02,294 INFO L231 Difference]: Finished difference. Result has 204 places, 201 transitions, 416 flow [2022-11-21 13:49:02,295 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=416, PETRI_PLACES=204, PETRI_TRANSITIONS=201} [2022-11-21 13:49:02,295 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, -3 predicate places. [2022-11-21 13:49:02,296 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 201 transitions, 416 flow [2022-11-21 13:49:02,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:02,296 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:02,296 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:02,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 13:49:02,297 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-21 13:49:02,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:02,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1020026128, now seen corresponding path program 1 times [2022-11-21 13:49:02,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:02,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338389628] [2022-11-21 13:49:02,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:02,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:02,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:02,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338389628] [2022-11-21 13:49:02,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338389628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:02,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:02,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:49:02,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368002856] [2022-11-21 13:49:02,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:02,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:49:02,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:02,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:49:02,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:49:02,467 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 236 [2022-11-21 13:49:02,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 201 transitions, 416 flow. Second operand has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:02,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:02,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 236 [2022-11-21 13:49:02,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:02,543 INFO L130 PetriNetUnfolder]: 4/344 cut-off events. [2022-11-21 13:49:02,543 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-21 13:49:02,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 344 events. 4/344 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1271 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 214. Up to 12 conditions per place. [2022-11-21 13:49:02,546 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 10 selfloop transitions, 4 changer transitions 0/201 dead transitions. [2022-11-21 13:49:02,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 201 transitions, 444 flow [2022-11-21 13:49:02,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:49:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 13:49:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 997 transitions. [2022-11-21 13:49:02,549 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8449152542372881 [2022-11-21 13:49:02,550 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 997 transitions. [2022-11-21 13:49:02,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 997 transitions. [2022-11-21 13:49:02,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:02,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 997 transitions. [2022-11-21 13:49:02,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 199.4) internal successors, (997), 5 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:02,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:02,555 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:02,555 INFO L175 Difference]: Start difference. First operand has 204 places, 201 transitions, 416 flow. Second operand 5 states and 997 transitions. [2022-11-21 13:49:02,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 201 transitions, 444 flow [2022-11-21 13:49:02,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 201 transitions, 438 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 13:49:02,560 INFO L231 Difference]: Finished difference. Result has 204 places, 199 transitions, 418 flow [2022-11-21 13:49:02,560 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=418, PETRI_PLACES=204, PETRI_TRANSITIONS=199} [2022-11-21 13:49:02,561 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, -3 predicate places. [2022-11-21 13:49:02,561 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 199 transitions, 418 flow [2022-11-21 13:49:02,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:02,562 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:02,562 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:02,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 13:49:02,562 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-21 13:49:02,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:02,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1555706196, now seen corresponding path program 1 times [2022-11-21 13:49:02,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:02,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834900659] [2022-11-21 13:49:02,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:02,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:49:02,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:49:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:49:02,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:49:02,624 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 13:49:02,625 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2022-11-21 13:49:02,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2022-11-21 13:49:02,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2022-11-21 13:49:02,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2022-11-21 13:49:02,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2022-11-21 13:49:02,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2022-11-21 13:49:02,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2022-11-21 13:49:02,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2022-11-21 13:49:02,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2022-11-21 13:49:02,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2022-11-21 13:49:02,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2022-11-21 13:49:02,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2022-11-21 13:49:02,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2022-11-21 13:49:02,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2022-11-21 13:49:02,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2022-11-21 13:49:02,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2022-11-21 13:49:02,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2022-11-21 13:49:02,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2022-11-21 13:49:02,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2022-11-21 13:49:02,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2022-11-21 13:49:02,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2022-11-21 13:49:02,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 13:49:02,632 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-21 13:49:02,634 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-21 13:49:02,634 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-21 13:49:02,670 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-21 13:49:02,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 303 transitions, 624 flow [2022-11-21 13:49:02,749 INFO L130 PetriNetUnfolder]: 72/498 cut-off events. [2022-11-21 13:49:02,749 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-21 13:49:02,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 498 events. 72/498 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1960 event pairs, 0 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 317. Up to 12 conditions per place. [2022-11-21 13:49:02,754 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 303 transitions, 624 flow [2022-11-21 13:49:02,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 265 places, 301 transitions, 620 flow [2022-11-21 13:49:02,773 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:49:02,776 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7202638b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:49:02,776 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-21 13:49:02,782 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-21 13:49:02,783 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 13:49:02,783 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:02,783 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:02,783 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-21 13:49:02,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash -721415730, now seen corresponding path program 1 times [2022-11-21 13:49:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:02,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870753937] [2022-11-21 13:49:02,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:02,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:02,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:02,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870753937] [2022-11-21 13:49:02,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870753937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:02,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:02,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:49:02,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099814992] [2022-11-21 13:49:02,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:02,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:49:02,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:02,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:49:02,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:49:02,892 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 303 [2022-11-21 13:49:02,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 301 transitions, 620 flow. Second operand has 6 states, 6 states have (on average 245.33333333333334) internal successors, (1472), 6 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:02,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:02,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 303 [2022-11-21 13:49:02,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:03,139 INFO L130 PetriNetUnfolder]: 16/791 cut-off events. [2022-11-21 13:49:03,139 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-11-21 13:49:03,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 791 events. 16/791 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4618 event pairs, 0 based on Foata normal form. 176/869 useless extension candidates. Maximal degree in co-relation 502. Up to 12 conditions per place. [2022-11-21 13:49:03,151 INFO L137 encePairwiseOnDemand]: 259/303 looper letters, 15 selfloop transitions, 8 changer transitions 0/266 dead transitions. [2022-11-21 13:49:03,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 266 transitions, 610 flow [2022-11-21 13:49:03,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:49:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-21 13:49:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2046 transitions. [2022-11-21 13:49:03,158 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.844059405940594 [2022-11-21 13:49:03,158 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2046 transitions. [2022-11-21 13:49:03,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2046 transitions. [2022-11-21 13:49:03,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:03,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2046 transitions. [2022-11-21 13:49:03,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 255.75) internal successors, (2046), 8 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:03,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:03,174 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:03,174 INFO L175 Difference]: Start difference. First operand has 265 places, 301 transitions, 620 flow. Second operand 8 states and 2046 transitions. [2022-11-21 13:49:03,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 266 transitions, 610 flow [2022-11-21 13:49:03,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 266 transitions, 610 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 13:49:03,180 INFO L231 Difference]: Finished difference. Result has 268 places, 262 transitions, 558 flow [2022-11-21 13:49:03,181 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=558, PETRI_PLACES=268, PETRI_TRANSITIONS=262} [2022-11-21 13:49:03,183 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 3 predicate places. [2022-11-21 13:49:03,183 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 262 transitions, 558 flow [2022-11-21 13:49:03,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.33333333333334) internal successors, (1472), 6 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:03,184 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:03,184 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:03,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 13:49:03,186 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-21 13:49:03,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:03,187 INFO L85 PathProgramCache]: Analyzing trace with hash -721425760, now seen corresponding path program 1 times [2022-11-21 13:49:03,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:03,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673987260] [2022-11-21 13:49:03,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:03,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:03,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:03,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673987260] [2022-11-21 13:49:03,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673987260] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:03,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:03,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:49:03,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644730863] [2022-11-21 13:49:03,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:03,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:49:03,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:03,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:49:03,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:49:03,276 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 303 [2022-11-21 13:49:03,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 262 transitions, 558 flow. Second operand has 4 states, 4 states have (on average 247.5) internal successors, (990), 4 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:03,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:03,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 303 [2022-11-21 13:49:03,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:03,453 INFO L130 PetriNetUnfolder]: 16/790 cut-off events. [2022-11-21 13:49:03,453 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-11-21 13:49:03,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 790 events. 16/790 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4612 event pairs, 0 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 507. Up to 20 conditions per place. [2022-11-21 13:49:03,465 INFO L137 encePairwiseOnDemand]: 298/303 looper letters, 13 selfloop transitions, 4 changer transitions 0/261 dead transitions. [2022-11-21 13:49:03,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 261 transitions, 590 flow [2022-11-21 13:49:03,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:49:03,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 13:49:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1248 transitions. [2022-11-21 13:49:03,469 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8237623762376237 [2022-11-21 13:49:03,469 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1248 transitions. [2022-11-21 13:49:03,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1248 transitions. [2022-11-21 13:49:03,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:03,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1248 transitions. [2022-11-21 13:49:03,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 249.6) internal successors, (1248), 5 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:03,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:03,477 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:03,477 INFO L175 Difference]: Start difference. First operand has 268 places, 262 transitions, 558 flow. Second operand 5 states and 1248 transitions. [2022-11-21 13:49:03,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 261 transitions, 590 flow [2022-11-21 13:49:03,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 261 transitions, 574 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-21 13:49:03,483 INFO L231 Difference]: Finished difference. Result has 264 places, 261 transitions, 548 flow [2022-11-21 13:49:03,483 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=548, PETRI_PLACES=264, PETRI_TRANSITIONS=261} [2022-11-21 13:49:03,484 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -1 predicate places. [2022-11-21 13:49:03,484 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 261 transitions, 548 flow [2022-11-21 13:49:03,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 247.5) internal successors, (990), 4 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:03,485 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:03,485 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:03,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 13:49:03,485 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-21 13:49:03,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:03,486 INFO L85 PathProgramCache]: Analyzing trace with hash -889050421, now seen corresponding path program 1 times [2022-11-21 13:49:03,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:03,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120861388] [2022-11-21 13:49:03,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:03,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:03,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:03,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120861388] [2022-11-21 13:49:03,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120861388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:03,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:03,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:49:03,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214054861] [2022-11-21 13:49:03,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:03,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:49:03,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:03,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:49:03,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:49:03,563 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 303 [2022-11-21 13:49:03,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 261 transitions, 548 flow. Second operand has 5 states, 5 states have (on average 245.8) internal successors, (1229), 5 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:03,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:03,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 303 [2022-11-21 13:49:03,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:03,775 INFO L130 PetriNetUnfolder]: 16/789 cut-off events. [2022-11-21 13:49:03,775 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-11-21 13:49:03,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 789 events. 16/789 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4617 event pairs, 0 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 503. Up to 12 conditions per place. [2022-11-21 13:49:03,785 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 16 selfloop transitions, 6 changer transitions 0/264 dead transitions. [2022-11-21 13:49:03,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 264 transitions, 612 flow [2022-11-21 13:49:03,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:49:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 13:49:03,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1487 transitions. [2022-11-21 13:49:03,789 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.817931793179318 [2022-11-21 13:49:03,789 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1487 transitions. [2022-11-21 13:49:03,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1487 transitions. [2022-11-21 13:49:03,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:03,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1487 transitions. [2022-11-21 13:49:03,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:03,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:03,800 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:03,800 INFO L175 Difference]: Start difference. First operand has 264 places, 261 transitions, 548 flow. Second operand 6 states and 1487 transitions. [2022-11-21 13:49:03,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 264 transitions, 612 flow [2022-11-21 13:49:03,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 264 transitions, 604 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 13:49:03,810 INFO L231 Difference]: Finished difference. Result has 264 places, 260 transitions, 550 flow [2022-11-21 13:49:03,811 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=264, PETRI_TRANSITIONS=260} [2022-11-21 13:49:03,813 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -1 predicate places. [2022-11-21 13:49:03,813 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 260 transitions, 550 flow [2022-11-21 13:49:03,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 245.8) internal successors, (1229), 5 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:03,815 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:03,815 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:03,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 13:49:03,816 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-21 13:49:03,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:03,816 INFO L85 PathProgramCache]: Analyzing trace with hash -889361272, now seen corresponding path program 1 times [2022-11-21 13:49:03,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:03,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609994993] [2022-11-21 13:49:03,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:03,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:03,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:03,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609994993] [2022-11-21 13:49:03,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609994993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:03,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:03,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:49:03,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188525155] [2022-11-21 13:49:03,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:03,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:49:03,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:03,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:49:03,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:49:03,894 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 303 [2022-11-21 13:49:03,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 260 transitions, 550 flow. Second operand has 4 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:03,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:03,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 303 [2022-11-21 13:49:03,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:04,065 INFO L130 PetriNetUnfolder]: 16/788 cut-off events. [2022-11-21 13:49:04,065 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-11-21 13:49:04,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 788 events. 16/788 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4619 event pairs, 0 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 502. Up to 13 conditions per place. [2022-11-21 13:49:04,078 INFO L137 encePairwiseOnDemand]: 299/303 looper letters, 17 selfloop transitions, 3 changer transitions 0/263 dead transitions. [2022-11-21 13:49:04,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 263 transitions, 610 flow [2022-11-21 13:49:04,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:49:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-21 13:49:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1005 transitions. [2022-11-21 13:49:04,081 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8292079207920792 [2022-11-21 13:49:04,081 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1005 transitions. [2022-11-21 13:49:04,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1005 transitions. [2022-11-21 13:49:04,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:04,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1005 transitions. [2022-11-21 13:49:04,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 251.25) internal successors, (1005), 4 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:04,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:04,087 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:04,088 INFO L175 Difference]: Start difference. First operand has 264 places, 260 transitions, 550 flow. Second operand 4 states and 1005 transitions. [2022-11-21 13:49:04,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 263 transitions, 610 flow [2022-11-21 13:49:04,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 263 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-21 13:49:04,094 INFO L231 Difference]: Finished difference. Result has 261 places, 259 transitions, 542 flow [2022-11-21 13:49:04,095 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=542, PETRI_PLACES=261, PETRI_TRANSITIONS=259} [2022-11-21 13:49:04,096 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -4 predicate places. [2022-11-21 13:49:04,096 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 259 transitions, 542 flow [2022-11-21 13:49:04,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:04,097 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:04,097 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:04,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 13:49:04,097 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-21 13:49:04,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:04,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2028266641, now seen corresponding path program 1 times [2022-11-21 13:49:04,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:04,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547621913] [2022-11-21 13:49:04,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:04,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:04,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:04,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547621913] [2022-11-21 13:49:04,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547621913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:04,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:04,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:49:04,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677748526] [2022-11-21 13:49:04,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:04,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:49:04,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:04,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:49:04,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:49:04,197 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-21 13:49:04,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 259 transitions, 542 flow. Second operand has 4 states, 4 states have (on average 250.75) internal successors, (1003), 4 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:04,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:04,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-21 13:49:04,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:04,374 INFO L130 PetriNetUnfolder]: 12/680 cut-off events. [2022-11-21 13:49:04,374 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-11-21 13:49:04,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 680 events. 12/680 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3613 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 403. Up to 40 conditions per place. [2022-11-21 13:49:04,384 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 19 selfloop transitions, 4 changer transitions 0/266 dead transitions. [2022-11-21 13:49:04,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 266 transitions, 602 flow [2022-11-21 13:49:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:49:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 13:49:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1271 transitions. [2022-11-21 13:49:04,388 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.838943894389439 [2022-11-21 13:49:04,388 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1271 transitions. [2022-11-21 13:49:04,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1271 transitions. [2022-11-21 13:49:04,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:04,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1271 transitions. [2022-11-21 13:49:04,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 254.2) internal successors, (1271), 5 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:04,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:04,396 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:04,396 INFO L175 Difference]: Start difference. First operand has 261 places, 259 transitions, 542 flow. Second operand 5 states and 1271 transitions. [2022-11-21 13:49:04,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 266 transitions, 602 flow [2022-11-21 13:49:04,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 266 transitions, 596 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 13:49:04,402 INFO L231 Difference]: Finished difference. Result has 265 places, 262 transitions, 568 flow [2022-11-21 13:49:04,402 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=568, PETRI_PLACES=265, PETRI_TRANSITIONS=262} [2022-11-21 13:49:04,403 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 0 predicate places. [2022-11-21 13:49:04,403 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 262 transitions, 568 flow [2022-11-21 13:49:04,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 250.75) internal successors, (1003), 4 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:04,404 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:04,404 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:04,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 13:49:04,405 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-21 13:49:04,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:04,406 INFO L85 PathProgramCache]: Analyzing trace with hash -705965156, now seen corresponding path program 1 times [2022-11-21 13:49:04,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:04,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279444109] [2022-11-21 13:49:04,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:04,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:04,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:04,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279444109] [2022-11-21 13:49:04,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279444109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:04,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:04,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 13:49:04,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754758087] [2022-11-21 13:49:04,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:04,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:49:04,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:04,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:49:04,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:49:04,991 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 303 [2022-11-21 13:49:04,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 262 transitions, 568 flow. Second operand has 11 states, 11 states have (on average 181.8181818181818) internal successors, (2000), 11 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:04,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:04,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 303 [2022-11-21 13:49:04,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:11,753 INFO L130 PetriNetUnfolder]: 13302/34708 cut-off events. [2022-11-21 13:49:11,753 INFO L131 PetriNetUnfolder]: For 222/222 co-relation queries the response was YES. [2022-11-21 13:49:11,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55342 conditions, 34708 events. 13302/34708 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 1270. Compared 425912 event pairs, 3906 based on Foata normal form. 0/31655 useless extension candidates. Maximal degree in co-relation 55210. Up to 11887 conditions per place. [2022-11-21 13:49:12,065 INFO L137 encePairwiseOnDemand]: 287/303 looper letters, 338 selfloop transitions, 33 changer transitions 0/546 dead transitions. [2022-11-21 13:49:12,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 546 transitions, 1924 flow [2022-11-21 13:49:12,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 13:49:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-21 13:49:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3405 transitions. [2022-11-21 13:49:12,077 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6610366919044846 [2022-11-21 13:49:12,077 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3405 transitions. [2022-11-21 13:49:12,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3405 transitions. [2022-11-21 13:49:12,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:12,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3405 transitions. [2022-11-21 13:49:12,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 200.2941176470588) internal successors, (3405), 17 states have internal predecessors, (3405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:12,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 303.0) internal successors, (5454), 18 states have internal predecessors, (5454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:12,101 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 303.0) internal successors, (5454), 18 states have internal predecessors, (5454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:12,101 INFO L175 Difference]: Start difference. First operand has 265 places, 262 transitions, 568 flow. Second operand 17 states and 3405 transitions. [2022-11-21 13:49:12,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 546 transitions, 1924 flow [2022-11-21 13:49:12,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 546 transitions, 1922 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 13:49:12,118 INFO L231 Difference]: Finished difference. Result has 290 places, 293 transitions, 805 flow [2022-11-21 13:49:12,119 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=805, PETRI_PLACES=290, PETRI_TRANSITIONS=293} [2022-11-21 13:49:12,120 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 25 predicate places. [2022-11-21 13:49:12,120 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 293 transitions, 805 flow [2022-11-21 13:49:12,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.8181818181818) internal successors, (2000), 11 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:12,121 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:12,121 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:12,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 13:49:12,122 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-21 13:49:12,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:12,122 INFO L85 PathProgramCache]: Analyzing trace with hash -398556098, now seen corresponding path program 1 times [2022-11-21 13:49:12,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:12,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533505898] [2022-11-21 13:49:12,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:12,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:49:12,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:12,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533505898] [2022-11-21 13:49:12,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533505898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:12,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:12,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:49:12,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512406947] [2022-11-21 13:49:12,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:12,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:49:12,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:12,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:49:12,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:49:12,225 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-21 13:49:12,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 293 transitions, 805 flow. Second operand has 4 states, 4 states have (on average 252.75) internal successors, (1011), 4 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:12,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:12,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-21 13:49:12,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:12,473 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][230], [Black: 334#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 328#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 344#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (< |~#A~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 321#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 340#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 342#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, 320#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), t_funThread2of2ForFork0NotInUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 360#true, Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 336#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 346#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (< |~#A~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|))]) [2022-11-21 13:49:12,473 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-21 13:49:12,473 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-21 13:49:12,474 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-21 13:49:12,474 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-21 13:49:12,546 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][230], [Black: 334#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 328#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 344#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (< |~#A~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 321#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 340#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 342#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 16#t_funENTRYtrue, t_funThread1of2ForFork0NotInUse, 320#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), t_funThread2of2ForFork0InUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), 360#true, Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 336#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 346#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (< |~#A~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|))]) [2022-11-21 13:49:12,547 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-21 13:49:12,547 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-21 13:49:12,547 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-21 13:49:12,547 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-21 13:49:12,598 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1022] t_funEXIT-->L1040-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][272], [Black: 334#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 328#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 344#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (< |~#A~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 321#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 340#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 342#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0NotInUse, 320#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), 360#true, Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 336#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 346#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (< |~#A~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|))]) [2022-11-21 13:49:12,598 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-21 13:49:12,598 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-21 13:49:12,598 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-21 13:49:12,599 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-21 13:49:12,601 INFO L130 PetriNetUnfolder]: 123/1466 cut-off events. [2022-11-21 13:49:12,601 INFO L131 PetriNetUnfolder]: For 712/851 co-relation queries the response was YES. [2022-11-21 13:49:12,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2234 conditions, 1466 events. 123/1466 cut-off events. For 712/851 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 10875 event pairs, 26 based on Foata normal form. 19/1340 useless extension candidates. Maximal degree in co-relation 1992. Up to 127 conditions per place. [2022-11-21 13:49:12,623 INFO L137 encePairwiseOnDemand]: 297/303 looper letters, 11 selfloop transitions, 8 changer transitions 0/293 dead transitions. [2022-11-21 13:49:12,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 293 transitions, 841 flow [2022-11-21 13:49:12,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:49:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 13:49:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1262 transitions. [2022-11-21 13:49:12,628 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.833003300330033 [2022-11-21 13:49:12,628 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1262 transitions. [2022-11-21 13:49:12,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1262 transitions. [2022-11-21 13:49:12,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:12,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1262 transitions. [2022-11-21 13:49:12,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 252.4) internal successors, (1262), 5 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:12,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:12,636 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:12,637 INFO L175 Difference]: Start difference. First operand has 290 places, 293 transitions, 805 flow. Second operand 5 states and 1262 transitions. [2022-11-21 13:49:12,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 293 transitions, 841 flow [2022-11-21 13:49:12,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 293 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 13:49:12,650 INFO L231 Difference]: Finished difference. Result has 292 places, 293 transitions, 822 flow [2022-11-21 13:49:12,651 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=822, PETRI_PLACES=292, PETRI_TRANSITIONS=293} [2022-11-21 13:49:12,652 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 27 predicate places. [2022-11-21 13:49:12,652 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 293 transitions, 822 flow [2022-11-21 13:49:12,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 252.75) internal successors, (1011), 4 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:12,653 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:12,653 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:12,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 13:49:12,653 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-21 13:49:12,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:12,654 INFO L85 PathProgramCache]: Analyzing trace with hash 529663684, now seen corresponding path program 1 times [2022-11-21 13:49:12,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:12,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078743479] [2022-11-21 13:49:12,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:12,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:12,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:12,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078743479] [2022-11-21 13:49:12,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078743479] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:49:12,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875167965] [2022-11-21 13:49:12,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:12,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:12,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:49:12,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:49:12,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 13:49:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:12,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 13:49:12,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:49:13,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:13,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:49:13,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875167965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:13,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:49:13,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-21 13:49:13,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42894199] [2022-11-21 13:49:13,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:13,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:49:13,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:13,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:49:13,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:49:13,049 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-21 13:49:13,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 293 transitions, 822 flow. Second operand has 5 states, 5 states have (on average 252.2) internal successors, (1261), 5 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:13,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:13,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-21 13:49:13,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:13,387 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][229], [Black: 334#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 328#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 344#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (< |~#A~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 321#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 340#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 342#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0NotInUse, 320#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), 586#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 360#true, Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 336#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 346#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (< |~#A~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|))]) [2022-11-21 13:49:13,387 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-21 13:49:13,387 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-21 13:49:13,388 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-21 13:49:13,388 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-21 13:49:13,440 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][229], [Black: 334#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 328#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 344#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (< |~#A~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 321#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 340#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 342#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 16#t_funENTRYtrue, t_funThread1of2ForFork0NotInUse, 320#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), t_funThread2of2ForFork0InUse, 586#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 360#true, Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 336#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 346#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (< |~#A~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|))]) [2022-11-21 13:49:13,440 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-21 13:49:13,440 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-21 13:49:13,441 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-21 13:49:13,441 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-21 13:49:13,480 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1022] t_funEXIT-->L1040-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][271], [Black: 334#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 332#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 328#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 344#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (< |~#A~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 321#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 340#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 330#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 342#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0NotInUse, 320#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), 586#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), 360#true, Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 336#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 346#(and (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~post7#1| 0) (< |~#A~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|))]) [2022-11-21 13:49:13,480 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-21 13:49:13,480 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-21 13:49:13,481 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-21 13:49:13,481 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-21 13:49:13,482 INFO L130 PetriNetUnfolder]: 123/1465 cut-off events. [2022-11-21 13:49:13,483 INFO L131 PetriNetUnfolder]: For 719/848 co-relation queries the response was YES. [2022-11-21 13:49:13,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 1465 events. 123/1465 cut-off events. For 719/848 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 10972 event pairs, 26 based on Foata normal form. 7/1327 useless extension candidates. Maximal degree in co-relation 2001. Up to 127 conditions per place. [2022-11-21 13:49:13,502 INFO L137 encePairwiseOnDemand]: 299/303 looper letters, 13 selfloop transitions, 5 changer transitions 0/292 dead transitions. [2022-11-21 13:49:13,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 292 transitions, 854 flow [2022-11-21 13:49:13,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:49:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-21 13:49:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1011 transitions. [2022-11-21 13:49:13,505 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8341584158415841 [2022-11-21 13:49:13,505 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1011 transitions. [2022-11-21 13:49:13,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1011 transitions. [2022-11-21 13:49:13,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:13,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1011 transitions. [2022-11-21 13:49:13,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 252.75) internal successors, (1011), 4 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:13,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:13,511 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:13,511 INFO L175 Difference]: Start difference. First operand has 292 places, 293 transitions, 822 flow. Second operand 4 states and 1011 transitions. [2022-11-21 13:49:13,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 292 transitions, 854 flow [2022-11-21 13:49:13,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 292 transitions, 842 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 13:49:13,522 INFO L231 Difference]: Finished difference. Result has 291 places, 292 transitions, 816 flow [2022-11-21 13:49:13,523 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=816, PETRI_PLACES=291, PETRI_TRANSITIONS=292} [2022-11-21 13:49:13,523 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 26 predicate places. [2022-11-21 13:49:13,524 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 292 transitions, 816 flow [2022-11-21 13:49:13,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 252.2) internal successors, (1261), 5 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:13,524 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:13,525 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:13,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-21 13:49:13,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:13,730 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-21 13:49:13,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:13,731 INFO L85 PathProgramCache]: Analyzing trace with hash 471904340, now seen corresponding path program 1 times [2022-11-21 13:49:13,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:13,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539227781] [2022-11-21 13:49:13,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:13,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:13,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:13,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539227781] [2022-11-21 13:49:13,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539227781] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:49:13,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682154569] [2022-11-21 13:49:13,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:13,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:13,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:49:13,834 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:49:13,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 13:49:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:13,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 13:49:13,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:49:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:14,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:49:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:14,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682154569] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:49:14,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:49:14,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-21 13:49:14,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984168760] [2022-11-21 13:49:14,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:49:14,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 13:49:14,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:14,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:49:14,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:49:14,069 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-21 13:49:14,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 292 transitions, 816 flow. Second operand has 10 states, 10 states have (on average 251.9) internal successors, (2519), 10 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:14,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:14,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-21 13:49:14,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:14,176 INFO L130 PetriNetUnfolder]: 3/307 cut-off events. [2022-11-21 13:49:14,176 INFO L131 PetriNetUnfolder]: For 67/70 co-relation queries the response was YES. [2022-11-21 13:49:14,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 307 events. 3/307 cut-off events. For 67/70 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 807 event pairs, 0 based on Foata normal form. 2/290 useless extension candidates. Maximal degree in co-relation 378. Up to 8 conditions per place. [2022-11-21 13:49:14,177 INFO L137 encePairwiseOnDemand]: 298/303 looper letters, 13 selfloop transitions, 7 changer transitions 0/204 dead transitions. [2022-11-21 13:49:14,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 204 transitions, 588 flow [2022-11-21 13:49:14,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:49:14,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 13:49:14,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2263 transitions. [2022-11-21 13:49:14,183 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8298496516318299 [2022-11-21 13:49:14,183 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2263 transitions. [2022-11-21 13:49:14,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2263 transitions. [2022-11-21 13:49:14,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:14,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2263 transitions. [2022-11-21 13:49:14,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 251.44444444444446) internal successors, (2263), 9 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:14,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 303.0) internal successors, (3030), 10 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:14,196 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 303.0) internal successors, (3030), 10 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:14,196 INFO L175 Difference]: Start difference. First operand has 291 places, 292 transitions, 816 flow. Second operand 9 states and 2263 transitions. [2022-11-21 13:49:14,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 204 transitions, 588 flow [2022-11-21 13:49:14,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 204 transitions, 548 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-11-21 13:49:14,206 INFO L231 Difference]: Finished difference. Result has 216 places, 199 transitions, 510 flow [2022-11-21 13:49:14,206 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=510, PETRI_PLACES=216, PETRI_TRANSITIONS=199} [2022-11-21 13:49:14,207 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -49 predicate places. [2022-11-21 13:49:14,207 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 199 transitions, 510 flow [2022-11-21 13:49:14,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 251.9) internal successors, (2519), 10 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:14,208 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:14,208 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:14,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 13:49:14,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5fd1d2-fabc-4fa7-b9ba-c5c93c907929/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:14,409 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-21 13:49:14,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:14,410 INFO L85 PathProgramCache]: Analyzing trace with hash -310183793, now seen corresponding path program 1 times [2022-11-21 13:49:14,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:14,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252054300] [2022-11-21 13:49:14,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:14,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:14,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:14,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252054300] [2022-11-21 13:49:14,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252054300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:14,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:14,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:49:14,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909531812] [2022-11-21 13:49:14,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:14,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:49:14,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:14,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:49:14,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:49:14,594 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 303 [2022-11-21 13:49:14,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 199 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 207.33333333333334) internal successors, (1244), 6 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:14,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:14,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 303 [2022-11-21 13:49:14,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:15,539 INFO L130 PetriNetUnfolder]: 1007/3735 cut-off events. [2022-11-21 13:49:15,539 INFO L131 PetriNetUnfolder]: For 717/742 co-relation queries the response was YES. [2022-11-21 13:49:15,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6310 conditions, 3735 events. 1007/3735 cut-off events. For 717/742 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 35417 event pairs, 357 based on Foata normal form. 23/3391 useless extension candidates. Maximal degree in co-relation 3017. Up to 781 conditions per place. [2022-11-21 13:49:15,570 INFO L137 encePairwiseOnDemand]: 289/303 looper letters, 132 selfloop transitions, 32 changer transitions 0/299 dead transitions. [2022-11-21 13:49:15,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 299 transitions, 1146 flow [2022-11-21 13:49:15,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:49:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-21 13:49:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2367 transitions. [2022-11-21 13:49:15,578 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7101710171017102 [2022-11-21 13:49:15,578 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2367 transitions. [2022-11-21 13:49:15,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2367 transitions. [2022-11-21 13:49:15,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:15,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2367 transitions. [2022-11-21 13:49:15,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 215.1818181818182) internal successors, (2367), 11 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:15,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 303.0) internal successors, (3636), 12 states have internal predecessors, (3636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:15,596 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 303.0) internal successors, (3636), 12 states have internal predecessors, (3636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:15,596 INFO L175 Difference]: Start difference. First operand has 216 places, 199 transitions, 510 flow. Second operand 11 states and 2367 transitions. [2022-11-21 13:49:15,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 299 transitions, 1146 flow [2022-11-21 13:49:15,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 299 transitions, 1123 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-11-21 13:49:15,605 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 730 flow [2022-11-21 13:49:15,606 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=730, PETRI_PLACES=225, PETRI_TRANSITIONS=225} [2022-11-21 13:49:15,607 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -40 predicate places. [2022-11-21 13:49:15,607 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 730 flow [2022-11-21 13:49:15,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 207.33333333333334) internal successors, (1244), 6 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:15,607 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:15,608 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:15,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 13:49:15,608 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-21 13:49:15,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:15,608 INFO L85 PathProgramCache]: Analyzing trace with hash 766382659, now seen corresponding path program 1 times [2022-11-21 13:49:15,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:15,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564544133] [2022-11-21 13:49:15,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:15,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:49:15,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:49:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:49:15,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:49:15,676 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 13:49:15,677 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2022-11-21 13:49:15,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2022-11-21 13:49:15,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2022-11-21 13:49:15,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2022-11-21 13:49:15,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2022-11-21 13:49:15,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2022-11-21 13:49:15,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2022-11-21 13:49:15,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2022-11-21 13:49:15,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2022-11-21 13:49:15,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2022-11-21 13:49:15,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2022-11-21 13:49:15,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2022-11-21 13:49:15,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2022-11-21 13:49:15,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2022-11-21 13:49:15,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2022-11-21 13:49:15,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2022-11-21 13:49:15,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2022-11-21 13:49:15,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2022-11-21 13:49:15,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2022-11-21 13:49:15,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2022-11-21 13:49:15,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2022-11-21 13:49:15,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2022-11-21 13:49:15,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2022-11-21 13:49:15,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2022-11-21 13:49:15,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2022-11-21 13:49:15,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 13:49:15,682 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:15,683 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-21 13:49:15,683 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-21 13:49:15,735 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-21 13:49:15,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 370 transitions, 770 flow [2022-11-21 13:49:15,863 INFO L130 PetriNetUnfolder]: 106/722 cut-off events. [2022-11-21 13:49:15,863 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-21 13:49:15,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 722 events. 106/722 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3161 event pairs, 1 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 506. Up to 16 conditions per place. [2022-11-21 13:49:15,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 370 transitions, 770 flow [2022-11-21 13:49:15,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 321 places, 368 transitions, 766 flow [2022-11-21 13:49:15,887 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:49:15,887 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7202638b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:49:15,887 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-11-21 13:49:15,891 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-21 13:49:15,891 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 13:49:15,892 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:15,892 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:15,892 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-21 13:49:15,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:15,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1563167666, now seen corresponding path program 1 times [2022-11-21 13:49:15,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:15,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196762358] [2022-11-21 13:49:15,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:15,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:16,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:16,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196762358] [2022-11-21 13:49:16,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196762358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:16,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:16,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:49:16,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213825525] [2022-11-21 13:49:16,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:16,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:49:16,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:16,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:49:16,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:49:16,020 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 370 [2022-11-21 13:49:16,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 368 transitions, 766 flow. Second operand has 6 states, 6 states have (on average 298.3333333333333) internal successors, (1790), 6 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:16,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:16,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 370 [2022-11-21 13:49:16,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:16,320 INFO L130 PetriNetUnfolder]: 30/1181 cut-off events. [2022-11-21 13:49:16,320 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-11-21 13:49:16,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 1181 events. 30/1181 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7516 event pairs, 2 based on Foata normal form. 410/1439 useless extension candidates. Maximal degree in co-relation 834. Up to 24 conditions per place. [2022-11-21 13:49:16,344 INFO L137 encePairwiseOnDemand]: 315/370 looper letters, 19 selfloop transitions, 8 changer transitions 0/323 dead transitions. [2022-11-21 13:49:16,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 323 transitions, 754 flow [2022-11-21 13:49:16,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:49:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-21 13:49:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2496 transitions. [2022-11-21 13:49:16,349 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8432432432432433 [2022-11-21 13:49:16,350 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2496 transitions. [2022-11-21 13:49:16,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2496 transitions. [2022-11-21 13:49:16,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:16,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2496 transitions. [2022-11-21 13:49:16,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 312.0) internal successors, (2496), 8 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:16,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 370.0) internal successors, (3330), 9 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:16,367 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 370.0) internal successors, (3330), 9 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:16,367 INFO L175 Difference]: Start difference. First operand has 321 places, 368 transitions, 766 flow. Second operand 8 states and 2496 transitions. [2022-11-21 13:49:16,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 323 transitions, 754 flow [2022-11-21 13:49:16,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 323 transitions, 754 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 13:49:16,373 INFO L231 Difference]: Finished difference. Result has 323 places, 317 transitions, 680 flow [2022-11-21 13:49:16,374 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=680, PETRI_PLACES=323, PETRI_TRANSITIONS=317} [2022-11-21 13:49:16,375 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 2 predicate places. [2022-11-21 13:49:16,375 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 317 transitions, 680 flow [2022-11-21 13:49:16,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 298.3333333333333) internal successors, (1790), 6 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:16,376 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:16,376 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:16,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 13:49:16,376 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-21 13:49:16,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:16,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1563177696, now seen corresponding path program 1 times [2022-11-21 13:49:16,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:16,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587805819] [2022-11-21 13:49:16,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:16,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:16,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:16,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587805819] [2022-11-21 13:49:16,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587805819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:16,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:16,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:49:16,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330901315] [2022-11-21 13:49:16,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:16,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:49:16,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:16,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:49:16,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:49:16,417 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 370 [2022-11-21 13:49:16,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 317 transitions, 680 flow. Second operand has 4 states, 4 states have (on average 300.5) internal successors, (1202), 4 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:16,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:16,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 370 [2022-11-21 13:49:16,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:16,713 INFO L130 PetriNetUnfolder]: 30/1180 cut-off events. [2022-11-21 13:49:16,714 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-11-21 13:49:16,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 1180 events. 30/1180 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7551 event pairs, 2 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 839. Up to 38 conditions per place. [2022-11-21 13:49:16,738 INFO L137 encePairwiseOnDemand]: 365/370 looper letters, 15 selfloop transitions, 4 changer transitions 0/316 dead transitions. [2022-11-21 13:49:16,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 316 transitions, 716 flow [2022-11-21 13:49:16,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:49:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 13:49:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1515 transitions. [2022-11-21 13:49:16,745 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8189189189189189 [2022-11-21 13:49:16,745 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1515 transitions. [2022-11-21 13:49:16,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1515 transitions. [2022-11-21 13:49:16,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:16,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1515 transitions. [2022-11-21 13:49:16,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:16,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:16,755 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:16,755 INFO L175 Difference]: Start difference. First operand has 323 places, 317 transitions, 680 flow. Second operand 5 states and 1515 transitions. [2022-11-21 13:49:16,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 316 transitions, 716 flow [2022-11-21 13:49:16,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 316 transitions, 700 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-21 13:49:16,763 INFO L231 Difference]: Finished difference. Result has 319 places, 316 transitions, 670 flow [2022-11-21 13:49:16,764 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=670, PETRI_PLACES=319, PETRI_TRANSITIONS=316} [2022-11-21 13:49:16,766 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -2 predicate places. [2022-11-21 13:49:16,766 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 316 transitions, 670 flow [2022-11-21 13:49:16,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 300.5) internal successors, (1202), 4 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:16,767 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:16,767 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:16,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 13:49:16,768 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-21 13:49:16,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:16,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1213556291, now seen corresponding path program 1 times [2022-11-21 13:49:16,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:16,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848567994] [2022-11-21 13:49:16,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:16,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:16,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:16,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848567994] [2022-11-21 13:49:16,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848567994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:16,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:16,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:49:16,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814381425] [2022-11-21 13:49:16,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:16,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:49:16,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:16,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:49:16,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:49:16,841 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 370 [2022-11-21 13:49:16,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 316 transitions, 670 flow. Second operand has 5 states, 5 states have (on average 298.8) internal successors, (1494), 5 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:16,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:16,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 370 [2022-11-21 13:49:16,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:17,182 INFO L130 PetriNetUnfolder]: 30/1179 cut-off events. [2022-11-21 13:49:17,182 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-11-21 13:49:17,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 1179 events. 30/1179 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7543 event pairs, 2 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 835. Up to 24 conditions per place. [2022-11-21 13:49:17,205 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 20 selfloop transitions, 6 changer transitions 0/321 dead transitions. [2022-11-21 13:49:17,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 321 transitions, 756 flow [2022-11-21 13:49:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:49:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 13:49:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1809 transitions. [2022-11-21 13:49:17,209 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8148648648648649 [2022-11-21 13:49:17,209 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1809 transitions. [2022-11-21 13:49:17,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1809 transitions. [2022-11-21 13:49:17,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:17,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1809 transitions. [2022-11-21 13:49:17,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 301.5) internal successors, (1809), 6 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:17,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 370.0) internal successors, (2590), 7 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:17,220 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 370.0) internal successors, (2590), 7 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:17,220 INFO L175 Difference]: Start difference. First operand has 319 places, 316 transitions, 670 flow. Second operand 6 states and 1809 transitions. [2022-11-21 13:49:17,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 321 transitions, 756 flow [2022-11-21 13:49:17,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 321 transitions, 748 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 13:49:17,226 INFO L231 Difference]: Finished difference. Result has 319 places, 315 transitions, 672 flow [2022-11-21 13:49:17,227 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=672, PETRI_PLACES=319, PETRI_TRANSITIONS=315} [2022-11-21 13:49:17,228 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -2 predicate places. [2022-11-21 13:49:17,228 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 315 transitions, 672 flow [2022-11-21 13:49:17,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 298.8) internal successors, (1494), 5 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:17,229 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:17,229 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:17,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 13:49:17,229 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-21 13:49:17,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:17,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1213867142, now seen corresponding path program 1 times [2022-11-21 13:49:17,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:17,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36652082] [2022-11-21 13:49:17,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:17,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:17,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:17,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36652082] [2022-11-21 13:49:17,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36652082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:17,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:17,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:49:17,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545361041] [2022-11-21 13:49:17,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:17,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:49:17,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:17,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:49:17,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:49:17,272 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 370 [2022-11-21 13:49:17,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 315 transitions, 672 flow. Second operand has 4 states, 4 states have (on average 300.75) internal successors, (1203), 4 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:17,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:17,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 370 [2022-11-21 13:49:17,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:17,530 INFO L130 PetriNetUnfolder]: 30/1178 cut-off events. [2022-11-21 13:49:17,530 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-11-21 13:49:17,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 1178 events. 30/1178 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7514 event pairs, 2 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 834. Up to 24 conditions per place. [2022-11-21 13:49:17,553 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 21 selfloop transitions, 3 changer transitions 0/320 dead transitions. [2022-11-21 13:49:17,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 320 transitions, 754 flow [2022-11-21 13:49:17,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:49:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-21 13:49:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1221 transitions. [2022-11-21 13:49:17,556 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-21 13:49:17,556 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1221 transitions. [2022-11-21 13:49:17,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1221 transitions. [2022-11-21 13:49:17,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:17,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1221 transitions. [2022-11-21 13:49:17,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 305.25) internal successors, (1221), 4 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:17,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:17,564 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:17,564 INFO L175 Difference]: Start difference. First operand has 319 places, 315 transitions, 672 flow. Second operand 4 states and 1221 transitions. [2022-11-21 13:49:17,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 320 transitions, 754 flow [2022-11-21 13:49:17,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 320 transitions, 742 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-21 13:49:17,571 INFO L231 Difference]: Finished difference. Result has 316 places, 314 transitions, 664 flow [2022-11-21 13:49:17,571 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=664, PETRI_PLACES=316, PETRI_TRANSITIONS=314} [2022-11-21 13:49:17,572 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -5 predicate places. [2022-11-21 13:49:17,572 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 314 transitions, 664 flow [2022-11-21 13:49:17,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 300.75) internal successors, (1203), 4 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:17,573 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:17,573 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:17,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 13:49:17,573 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-21 13:49:17,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:17,576 INFO L85 PathProgramCache]: Analyzing trace with hash -387906227, now seen corresponding path program 1 times [2022-11-21 13:49:17,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:17,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443923366] [2022-11-21 13:49:17,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:17,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:17,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:17,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443923366] [2022-11-21 13:49:17,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443923366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:17,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:17,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:49:17,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705623856] [2022-11-21 13:49:17,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:17,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:49:17,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:17,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:49:17,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:49:17,646 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-21 13:49:17,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 314 transitions, 664 flow. Second operand has 4 states, 4 states have (on average 303.75) internal successors, (1215), 4 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:17,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:17,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-21 13:49:17,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:17,910 INFO L130 PetriNetUnfolder]: 26/1070 cut-off events. [2022-11-21 13:49:17,911 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-11-21 13:49:17,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 1070 events. 26/1070 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6566 event pairs, 2 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 754. Up to 78 conditions per place. [2022-11-21 13:49:17,933 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 21 selfloop transitions, 4 changer transitions 0/321 dead transitions. [2022-11-21 13:49:17,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 321 transitions, 728 flow [2022-11-21 13:49:17,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:49:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 13:49:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1538 transitions. [2022-11-21 13:49:17,938 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8313513513513513 [2022-11-21 13:49:17,938 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1538 transitions. [2022-11-21 13:49:17,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1538 transitions. [2022-11-21 13:49:17,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:17,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1538 transitions. [2022-11-21 13:49:17,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 307.6) internal successors, (1538), 5 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:17,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:17,948 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:17,948 INFO L175 Difference]: Start difference. First operand has 316 places, 314 transitions, 664 flow. Second operand 5 states and 1538 transitions. [2022-11-21 13:49:17,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 321 transitions, 728 flow [2022-11-21 13:49:17,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 321 transitions, 722 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 13:49:17,954 INFO L231 Difference]: Finished difference. Result has 320 places, 317 transitions, 690 flow [2022-11-21 13:49:17,955 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=690, PETRI_PLACES=320, PETRI_TRANSITIONS=317} [2022-11-21 13:49:17,955 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -1 predicate places. [2022-11-21 13:49:17,956 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 317 transitions, 690 flow [2022-11-21 13:49:17,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 303.75) internal successors, (1215), 4 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:17,956 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:17,957 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:17,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 13:49:17,957 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-21 13:49:17,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:17,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2106409688, now seen corresponding path program 1 times [2022-11-21 13:49:17,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:17,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874430840] [2022-11-21 13:49:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:17,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:18,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:18,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874430840] [2022-11-21 13:49:18,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874430840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:18,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:18,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 13:49:18,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147296966] [2022-11-21 13:49:18,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:18,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:49:18,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:18,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:49:18,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:49:18,471 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 370 [2022-11-21 13:49:18,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 317 transitions, 690 flow. Second operand has 11 states, 11 states have (on average 221.72727272727272) internal successors, (2439), 11 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:18,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:18,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 370 [2022-11-21 13:49:18,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand