./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e7bb482b 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_f58ba948-fc2b-47d7-a8e9-884c2e4d1b53/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58ba948-fc2b-47d7-a8e9-884c2e4d1b53/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58ba948-fc2b-47d7-a8e9-884c2e4d1b53/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58ba948-fc2b-47d7-a8e9-884c2e4d1b53/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58ba948-fc2b-47d7-a8e9-884c2e4d1b53/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58ba948-fc2b-47d7-a8e9-884c2e4d1b53/bin/uautomizer-verify-WvqO1wxjHP --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 f6b55d0b1c42ab7aaefa2efb35454af77e64d43e1c106bfebef7445a043c9409 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:08:05,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:08:05,559 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58ba948-fc2b-47d7-a8e9-884c2e4d1b53/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-06 23:08:05,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:08:05,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:08:05,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:08:05,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:08:05,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:08:05,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:08:05,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:08:05,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:08:05,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:08:05,608 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:08:05,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:08:05,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:08:05,610 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:08:05,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:08:05,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:08:05,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:08:05,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:08:05,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:08:05,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:08:05,613 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 23:08:05,613 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:08:05,614 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:08:05,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:08:05,615 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:08:05,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:08:05,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:08:05,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:08:05,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:08:05,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:08:05,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:08:05,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:08:05,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:08:05,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:08:05,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:08:05,630 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:08:05,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:08:05,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:08:05,631 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:08:05,631 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_f58ba948-fc2b-47d7-a8e9-884c2e4d1b53/bin/uautomizer-verify-WvqO1wxjHP/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_f58ba948-fc2b-47d7-a8e9-884c2e4d1b53/bin/uautomizer-verify-WvqO1wxjHP 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 -> f6b55d0b1c42ab7aaefa2efb35454af77e64d43e1c106bfebef7445a043c9409 [2023-11-06 23:08:05,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:08:05,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:08:05,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:08:05,973 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:08:05,973 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:08:05,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58ba948-fc2b-47d7-a8e9-884c2e4d1b53/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c [2023-11-06 23:08:09,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:08:09,336 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:08:09,337 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58ba948-fc2b-47d7-a8e9-884c2e4d1b53/sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c [2023-11-06 23:08:09,347 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58ba948-fc2b-47d7-a8e9-884c2e4d1b53/bin/uautomizer-verify-WvqO1wxjHP/data/0c5e96b35/5e11b9a1befa4a4eb8166ee647cafd8f/FLAG55fffa67c [2023-11-06 23:08:09,361 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58ba948-fc2b-47d7-a8e9-884c2e4d1b53/bin/uautomizer-verify-WvqO1wxjHP/data/0c5e96b35/5e11b9a1befa4a4eb8166ee647cafd8f [2023-11-06 23:08:09,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:08:09,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:08:09,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:08:09,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:08:09,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:08:09,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:08:09" (1/1) ... [2023-11-06 23:08:09,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@665b2532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:09, skipping insertion in model container [2023-11-06 23:08:09,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:08:09" (1/1) ... [2023-11-06 23:08:09,416 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:08:09,641 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:08:09,655 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:08:09,692 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:08:09,701 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:08:09,701 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:08:09,709 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:08:09,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:09 WrapperNode [2023-11-06 23:08:09,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:08:09,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:08:09,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:08:09,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:08:09,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:09" (1/1) ... [2023-11-06 23:08:09,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:09" (1/1) ... [2023-11-06 23:08:09,776 INFO L138 Inliner]: procedures = 22, calls = 111, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 278 [2023-11-06 23:08:09,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:08:09,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:08:09,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:08:09,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:08:09,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:09" (1/1) ... [2023-11-06 23:08:09,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:09" (1/1) ... [2023-11-06 23:08:09,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:09" (1/1) ... [2023-11-06 23:08:09,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:09" (1/1) ... [2023-11-06 23:08:09,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:09" (1/1) ... [2023-11-06 23:08:09,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:09" (1/1) ... [2023-11-06 23:08:09,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:09" (1/1) ... [2023-11-06 23:08:09,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:09" (1/1) ... [2023-11-06 23:08:09,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:08:09,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:08:09,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:08:09,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:08:09,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:09" (1/1) ... [2023-11-06 23:08:09,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:08:09,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58ba948-fc2b-47d7-a8e9-884c2e4d1b53/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:09,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58ba948-fc2b-47d7-a8e9-884c2e4d1b53/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:08:09,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58ba948-fc2b-47d7-a8e9-884c2e4d1b53/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:08:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:08:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-06 23:08:09,949 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-06 23:08:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-06 23:08:09,950 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-06 23:08:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-06 23:08:09,951 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-06 23:08:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:08:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:08:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:08:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:08:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:08:09,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:08:09,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:08:09,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:08:09,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:08:09,956 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 23:08:10,110 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:08:10,113 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:08:10,603 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:08:10,792 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:08:10,792 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:08:10,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:10 BoogieIcfgContainer [2023-11-06 23:08:10,795 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:08:10,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:08:10,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:08:10,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:08:10,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:08:09" (1/3) ... [2023-11-06 23:08:10,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732e1729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:08:10, skipping insertion in model container [2023-11-06 23:08:10,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:09" (2/3) ... [2023-11-06 23:08:10,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732e1729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:08:10, skipping insertion in model container [2023-11-06 23:08:10,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:10" (3/3) ... [2023-11-06 23:08:10,806 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2023-11-06 23:08:10,815 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 23:08:10,826 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:08:10,827 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-06 23:08:10,827 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:08:10,911 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-06 23:08:10,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 172 transitions, 365 flow [2023-11-06 23:08:11,051 INFO L124 PetriNetUnfolderBase]: 2/169 cut-off events. [2023-11-06 23:08:11,052 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 23:08:11,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 169 events. 2/169 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 164 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 121. Up to 2 conditions per place. [2023-11-06 23:08:11,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 172 transitions, 365 flow [2023-11-06 23:08:11,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 145 transitions, 305 flow [2023-11-06 23:08:11,067 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:08:11,078 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 145 transitions, 305 flow [2023-11-06 23:08:11,081 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 145 transitions, 305 flow [2023-11-06 23:08:11,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 145 transitions, 305 flow [2023-11-06 23:08:11,123 INFO L124 PetriNetUnfolderBase]: 1/145 cut-off events. [2023-11-06 23:08:11,124 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 23:08:11,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 145 events. 1/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 162 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 121. Up to 2 conditions per place. [2023-11-06 23:08:11,128 INFO L119 LiptonReduction]: Number of co-enabled transitions 3240 [2023-11-06 23:08:16,000 INFO L134 LiptonReduction]: Checked pairs total: 33947 [2023-11-06 23:08:16,001 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-11-06 23:08:16,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:08:16,023 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;@452efe82, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:08:16,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2023-11-06 23:08:16,027 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:08:16,027 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-06 23:08:16,027 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:08:16,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:16,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:08:16,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-06 23:08:16,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:16,034 INFO L85 PathProgramCache]: Analyzing trace with hash 768559240, now seen corresponding path program 1 times [2023-11-06 23:08:16,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:16,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988852745] [2023-11-06 23:08:16,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:16,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:16,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:16,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988852745] [2023-11-06 23:08:16,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988852745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:16,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:16,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:08:16,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896603939] [2023-11-06 23:08:16,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:16,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:08:16,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:08:16,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:08:16,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 278 [2023-11-06 23:08:16,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 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) [2023-11-06 23:08:16,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:16,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 278 [2023-11-06 23:08:16,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:18,905 INFO L124 PetriNetUnfolderBase]: 10335/15756 cut-off events. [2023-11-06 23:08:18,906 INFO L125 PetriNetUnfolderBase]: For 531/531 co-relation queries the response was YES. [2023-11-06 23:08:18,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31310 conditions, 15756 events. 10335/15756 cut-off events. For 531/531 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 107084 event pairs, 5987 based on Foata normal form. 88/13361 useless extension candidates. Maximal degree in co-relation 29258. Up to 14755 conditions per place. [2023-11-06 23:08:19,139 INFO L140 encePairwiseOnDemand]: 266/278 looper letters, 64 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2023-11-06 23:08:19,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 86 transitions, 342 flow [2023-11-06 23:08:19,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:08:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:08:19,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2023-11-06 23:08:19,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5440647482014388 [2023-11-06 23:08:19,164 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 605 transitions. [2023-11-06 23:08:19,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 605 transitions. [2023-11-06 23:08:19,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:19,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 605 transitions. [2023-11-06 23:08:19,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 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) [2023-11-06 23:08:19,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 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) [2023-11-06 23:08:19,185 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 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) [2023-11-06 23:08:19,187 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 133 flow. Second operand 4 states and 605 transitions. [2023-11-06 23:08:19,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 86 transitions, 342 flow [2023-11-06 23:08:19,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 86 transitions, 329 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-06 23:08:19,207 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 196 flow [2023-11-06 23:08:19,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2023-11-06 23:08:19,213 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places. [2023-11-06 23:08:19,213 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 196 flow [2023-11-06 23:08:19,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 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) [2023-11-06 23:08:19,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:19,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:19,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:08:19,215 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-06 23:08:19,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:19,216 INFO L85 PathProgramCache]: Analyzing trace with hash -38877458, now seen corresponding path program 1 times [2023-11-06 23:08:19,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:19,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806313035] [2023-11-06 23:08:19,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:19,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:19,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:19,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806313035] [2023-11-06 23:08:19,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806313035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:19,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:19,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:08:19,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995507494] [2023-11-06 23:08:19,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:19,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:08:19,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:19,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:08:19,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:08:19,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 278 [2023-11-06 23:08:19,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 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) [2023-11-06 23:08:19,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:19,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 278 [2023-11-06 23:08:19,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:21,602 INFO L124 PetriNetUnfolderBase]: 11214/17284 cut-off events. [2023-11-06 23:08:21,603 INFO L125 PetriNetUnfolderBase]: For 3835/4216 co-relation queries the response was YES. [2023-11-06 23:08:21,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38732 conditions, 17284 events. 11214/17284 cut-off events. For 3835/4216 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 115117 event pairs, 4352 based on Foata normal form. 238/15507 useless extension candidates. Maximal degree in co-relation 32971. Up to 16123 conditions per place. [2023-11-06 23:08:21,736 INFO L140 encePairwiseOnDemand]: 267/278 looper letters, 67 selfloop transitions, 11 changer transitions 0/93 dead transitions. [2023-11-06 23:08:21,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 93 transitions, 418 flow [2023-11-06 23:08:21,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:08:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:08:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 597 transitions. [2023-11-06 23:08:21,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5368705035971223 [2023-11-06 23:08:21,740 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 597 transitions. [2023-11-06 23:08:21,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 597 transitions. [2023-11-06 23:08:21,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:21,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 597 transitions. [2023-11-06 23:08:21,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.25) internal successors, (597), 4 states have internal predecessors, (597), 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) [2023-11-06 23:08:21,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 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) [2023-11-06 23:08:21,748 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 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) [2023-11-06 23:08:21,748 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 196 flow. Second operand 4 states and 597 transitions. [2023-11-06 23:08:21,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 93 transitions, 418 flow [2023-11-06 23:08:21,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 93 transitions, 418 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:08:21,761 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 279 flow [2023-11-06 23:08:21,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2023-11-06 23:08:21,769 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places. [2023-11-06 23:08:21,769 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 74 transitions, 279 flow [2023-11-06 23:08:21,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 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) [2023-11-06 23:08:21,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:21,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:21,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:08:21,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-06 23:08:21,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:21,774 INFO L85 PathProgramCache]: Analyzing trace with hash -437650130, now seen corresponding path program 2 times [2023-11-06 23:08:21,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:21,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159024192] [2023-11-06 23:08:21,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:21,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:22,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:22,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159024192] [2023-11-06 23:08:22,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159024192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:22,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:22,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:22,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790588014] [2023-11-06 23:08:22,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:22,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:22,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:22,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:22,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 278 [2023-11-06 23:08:22,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 74 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 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) [2023-11-06 23:08:22,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:22,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 278 [2023-11-06 23:08:22,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:24,428 INFO L124 PetriNetUnfolderBase]: 13163/20213 cut-off events. [2023-11-06 23:08:24,429 INFO L125 PetriNetUnfolderBase]: For 12107/12285 co-relation queries the response was YES. [2023-11-06 23:08:24,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50621 conditions, 20213 events. 13163/20213 cut-off events. For 12107/12285 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 136454 event pairs, 1577 based on Foata normal form. 620/18814 useless extension candidates. Maximal degree in co-relation 41730. Up to 16526 conditions per place. [2023-11-06 23:08:24,604 INFO L140 encePairwiseOnDemand]: 264/278 looper letters, 94 selfloop transitions, 18 changer transitions 0/125 dead transitions. [2023-11-06 23:08:24,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 125 transitions, 651 flow [2023-11-06 23:08:24,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:08:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:08:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 738 transitions. [2023-11-06 23:08:24,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5309352517985612 [2023-11-06 23:08:24,610 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 738 transitions. [2023-11-06 23:08:24,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 738 transitions. [2023-11-06 23:08:24,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:24,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 738 transitions. [2023-11-06 23:08:24,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 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) [2023-11-06 23:08:24,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 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) [2023-11-06 23:08:24,620 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 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) [2023-11-06 23:08:24,620 INFO L175 Difference]: Start difference. First operand has 74 places, 74 transitions, 279 flow. Second operand 5 states and 738 transitions. [2023-11-06 23:08:24,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 125 transitions, 651 flow [2023-11-06 23:08:24,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 125 transitions, 647 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-11-06 23:08:24,640 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 380 flow [2023-11-06 23:08:24,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=380, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2023-11-06 23:08:24,642 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 10 predicate places. [2023-11-06 23:08:24,643 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 380 flow [2023-11-06 23:08:24,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 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) [2023-11-06 23:08:24,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:24,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:24,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:08:24,649 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-06 23:08:24,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:24,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1109986596, now seen corresponding path program 1 times [2023-11-06 23:08:24,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:24,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157781610] [2023-11-06 23:08:24,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:24,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:25,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:25,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157781610] [2023-11-06 23:08:25,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157781610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:25,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:25,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:25,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067588391] [2023-11-06 23:08:25,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:25,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:25,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:25,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:25,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:25,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 278 [2023-11-06 23:08:25,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 380 flow. Second operand has 5 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 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) [2023-11-06 23:08:25,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:25,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 278 [2023-11-06 23:08:25,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:27,703 INFO L124 PetriNetUnfolderBase]: 15841/24075 cut-off events. [2023-11-06 23:08:27,704 INFO L125 PetriNetUnfolderBase]: For 30521/31207 co-relation queries the response was YES. [2023-11-06 23:08:27,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68987 conditions, 24075 events. 15841/24075 cut-off events. For 30521/31207 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 165691 event pairs, 3305 based on Foata normal form. 584/22537 useless extension candidates. Maximal degree in co-relation 54946. Up to 18388 conditions per place. [2023-11-06 23:08:27,919 INFO L140 encePairwiseOnDemand]: 266/278 looper letters, 105 selfloop transitions, 26 changer transitions 0/144 dead transitions. [2023-11-06 23:08:27,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 144 transitions, 900 flow [2023-11-06 23:08:27,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:08:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:08:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 752 transitions. [2023-11-06 23:08:27,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5410071942446043 [2023-11-06 23:08:27,924 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 752 transitions. [2023-11-06 23:08:27,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 752 transitions. [2023-11-06 23:08:27,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:27,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 752 transitions. [2023-11-06 23:08:27,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 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) [2023-11-06 23:08:27,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 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) [2023-11-06 23:08:27,934 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 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) [2023-11-06 23:08:27,935 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 380 flow. Second operand 5 states and 752 transitions. [2023-11-06 23:08:27,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 144 transitions, 900 flow [2023-11-06 23:08:27,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 144 transitions, 848 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-06 23:08:27,953 INFO L231 Difference]: Finished difference. Result has 83 places, 97 transitions, 575 flow [2023-11-06 23:08:27,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=575, PETRI_PLACES=83, PETRI_TRANSITIONS=97} [2023-11-06 23:08:27,956 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 14 predicate places. [2023-11-06 23:08:27,956 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 97 transitions, 575 flow [2023-11-06 23:08:27,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 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) [2023-11-06 23:08:27,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:27,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:27,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:08:27,958 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-06 23:08:27,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:27,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1544639595, now seen corresponding path program 1 times [2023-11-06 23:08:27,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:27,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274225344] [2023-11-06 23:08:27,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:27,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:28,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:28,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274225344] [2023-11-06 23:08:28,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274225344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:28,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:28,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:08:28,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594224455] [2023-11-06 23:08:28,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:28,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:08:28,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:28,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:08:28,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:08:28,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 278 [2023-11-06 23:08:28,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 97 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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) [2023-11-06 23:08:28,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:28,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 278 [2023-11-06 23:08:28,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:29,219 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][87], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 190#true, 213#true, 47#L96true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 183#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 169#L192-1true, 22#L139true, Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0))), 204#true]) [2023-11-06 23:08:29,219 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-06 23:08:29,219 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:08:29,220 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:08:29,220 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:08:29,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][87], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 190#true, 213#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 51#L103true, 183#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 169#L192-1true, 22#L139true, Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0))), 204#true]) [2023-11-06 23:08:29,376 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-06 23:08:29,376 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 23:08:29,376 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 23:08:29,376 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 23:08:29,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][87], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 190#true, 213#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 183#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 7#L106true, 169#L192-1true, 22#L139true, Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0))), 204#true]) [2023-11-06 23:08:29,473 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-06 23:08:29,473 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 23:08:29,473 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 23:08:29,473 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 23:08:29,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][87], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 29#L109true, 190#true, 213#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 183#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 169#L192-1true, 22#L139true, Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0))), 204#true]) [2023-11-06 23:08:29,719 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 23:08:29,719 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:08:29,719 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:08:29,719 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:08:29,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][87], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 14#L112true, 190#true, 213#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 183#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 169#L192-1true, 22#L139true, Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0))), 204#true]) [2023-11-06 23:08:29,755 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 23:08:29,755 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:08:29,755 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:08:29,755 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:08:29,957 INFO L124 PetriNetUnfolderBase]: 10164/15645 cut-off events. [2023-11-06 23:08:29,957 INFO L125 PetriNetUnfolderBase]: For 54051/58606 co-relation queries the response was YES. [2023-11-06 23:08:30,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51271 conditions, 15645 events. 10164/15645 cut-off events. For 54051/58606 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 105158 event pairs, 3796 based on Foata normal form. 1882/16276 useless extension candidates. Maximal degree in co-relation 29411. Up to 9070 conditions per place. [2023-11-06 23:08:30,089 INFO L140 encePairwiseOnDemand]: 268/278 looper letters, 105 selfloop transitions, 4 changer transitions 0/137 dead transitions. [2023-11-06 23:08:30,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 137 transitions, 1029 flow [2023-11-06 23:08:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:08:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:08:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2023-11-06 23:08:30,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5767386091127098 [2023-11-06 23:08:30,092 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 481 transitions. [2023-11-06 23:08:30,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 481 transitions. [2023-11-06 23:08:30,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:30,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 481 transitions. [2023-11-06 23:08:30,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 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) [2023-11-06 23:08:30,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 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) [2023-11-06 23:08:30,097 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 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) [2023-11-06 23:08:30,097 INFO L175 Difference]: Start difference. First operand has 83 places, 97 transitions, 575 flow. Second operand 3 states and 481 transitions. [2023-11-06 23:08:30,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 137 transitions, 1029 flow [2023-11-06 23:08:30,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 137 transitions, 1007 flow, removed 11 selfloop flow, removed 0 redundant places. [2023-11-06 23:08:30,141 INFO L231 Difference]: Finished difference. Result has 86 places, 100 transitions, 597 flow [2023-11-06 23:08:30,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=597, PETRI_PLACES=86, PETRI_TRANSITIONS=100} [2023-11-06 23:08:30,145 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 17 predicate places. [2023-11-06 23:08:30,145 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 100 transitions, 597 flow [2023-11-06 23:08:30,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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) [2023-11-06 23:08:30,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:30,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:30,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:08:30,146 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-06 23:08:30,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1562337018, now seen corresponding path program 1 times [2023-11-06 23:08:30,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:30,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857526676] [2023-11-06 23:08:30,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:30,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:30,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:30,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857526676] [2023-11-06 23:08:30,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857526676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:30,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:30,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:30,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518291306] [2023-11-06 23:08:30,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:30,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:30,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:30,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:30,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:30,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 278 [2023-11-06 23:08:30,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 100 transitions, 597 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 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) [2023-11-06 23:08:30,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:30,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 278 [2023-11-06 23:08:30,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:32,468 INFO L124 PetriNetUnfolderBase]: 12456/19140 cut-off events. [2023-11-06 23:08:32,468 INFO L125 PetriNetUnfolderBase]: For 44365/46266 co-relation queries the response was YES. [2023-11-06 23:08:32,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62601 conditions, 19140 events. 12456/19140 cut-off events. For 44365/46266 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 127675 event pairs, 3502 based on Foata normal form. 997/19251 useless extension candidates. Maximal degree in co-relation 45675. Up to 16348 conditions per place. [2023-11-06 23:08:32,628 INFO L140 encePairwiseOnDemand]: 265/278 looper letters, 111 selfloop transitions, 18 changer transitions 0/149 dead transitions. [2023-11-06 23:08:32,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 149 transitions, 1048 flow [2023-11-06 23:08:32,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:08:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:08:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 734 transitions. [2023-11-06 23:08:32,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5280575539568345 [2023-11-06 23:08:32,633 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 734 transitions. [2023-11-06 23:08:32,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 734 transitions. [2023-11-06 23:08:32,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:32,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 734 transitions. [2023-11-06 23:08:32,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 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) [2023-11-06 23:08:32,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 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) [2023-11-06 23:08:32,644 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 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) [2023-11-06 23:08:32,644 INFO L175 Difference]: Start difference. First operand has 86 places, 100 transitions, 597 flow. Second operand 5 states and 734 transitions. [2023-11-06 23:08:32,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 149 transitions, 1048 flow [2023-11-06 23:08:32,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 149 transitions, 1041 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:08:32,679 INFO L231 Difference]: Finished difference. Result has 90 places, 105 transitions, 682 flow [2023-11-06 23:08:32,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=682, PETRI_PLACES=90, PETRI_TRANSITIONS=105} [2023-11-06 23:08:32,682 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 21 predicate places. [2023-11-06 23:08:32,682 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 105 transitions, 682 flow [2023-11-06 23:08:32,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 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) [2023-11-06 23:08:32,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:32,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:32,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:08:32,684 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-06 23:08:32,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:32,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2141331845, now seen corresponding path program 1 times [2023-11-06 23:08:32,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:32,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391883010] [2023-11-06 23:08:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:32,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:32,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:32,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391883010] [2023-11-06 23:08:32,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391883010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:32,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:32,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:32,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071520156] [2023-11-06 23:08:32,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:32,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:32,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:32,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:32,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:33,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 278 [2023-11-06 23:08:33,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 105 transitions, 682 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 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) [2023-11-06 23:08:33,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:33,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 278 [2023-11-06 23:08:33,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:35,447 INFO L124 PetriNetUnfolderBase]: 14294/22003 cut-off events. [2023-11-06 23:08:35,447 INFO L125 PetriNetUnfolderBase]: For 59037/60942 co-relation queries the response was YES. [2023-11-06 23:08:35,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73434 conditions, 22003 events. 14294/22003 cut-off events. For 59037/60942 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 147936 event pairs, 6254 based on Foata normal form. 1389/22473 useless extension candidates. Maximal degree in co-relation 47079. Up to 19158 conditions per place. [2023-11-06 23:08:35,601 INFO L140 encePairwiseOnDemand]: 265/278 looper letters, 123 selfloop transitions, 20 changer transitions 0/162 dead transitions. [2023-11-06 23:08:35,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 162 transitions, 1193 flow [2023-11-06 23:08:35,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:08:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:08:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 734 transitions. [2023-11-06 23:08:35,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5280575539568345 [2023-11-06 23:08:35,606 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 734 transitions. [2023-11-06 23:08:35,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 734 transitions. [2023-11-06 23:08:35,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:35,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 734 transitions. [2023-11-06 23:08:35,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 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) [2023-11-06 23:08:35,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 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) [2023-11-06 23:08:35,614 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 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) [2023-11-06 23:08:35,615 INFO L175 Difference]: Start difference. First operand has 90 places, 105 transitions, 682 flow. Second operand 5 states and 734 transitions. [2023-11-06 23:08:35,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 162 transitions, 1193 flow [2023-11-06 23:08:35,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 162 transitions, 1160 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:08:35,646 INFO L231 Difference]: Finished difference. Result has 94 places, 121 transitions, 857 flow [2023-11-06 23:08:35,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=857, PETRI_PLACES=94, PETRI_TRANSITIONS=121} [2023-11-06 23:08:35,648 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 25 predicate places. [2023-11-06 23:08:35,648 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 121 transitions, 857 flow [2023-11-06 23:08:35,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 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) [2023-11-06 23:08:35,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:35,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:35,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:08:35,649 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-06 23:08:35,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:35,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1548488727, now seen corresponding path program 1 times [2023-11-06 23:08:35,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:35,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955495801] [2023-11-06 23:08:35,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:35,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:35,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:35,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955495801] [2023-11-06 23:08:35,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955495801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:35,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:35,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:35,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395835674] [2023-11-06 23:08:35,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:35,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:35,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:35,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:35,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:35,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 278 [2023-11-06 23:08:35,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 121 transitions, 857 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 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) [2023-11-06 23:08:35,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:35,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 278 [2023-11-06 23:08:35,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:38,546 INFO L124 PetriNetUnfolderBase]: 14169/21893 cut-off events. [2023-11-06 23:08:38,546 INFO L125 PetriNetUnfolderBase]: For 77201/79274 co-relation queries the response was YES. [2023-11-06 23:08:38,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78787 conditions, 21893 events. 14169/21893 cut-off events. For 77201/79274 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 149123 event pairs, 4173 based on Foata normal form. 1151/22116 useless extension candidates. Maximal degree in co-relation 54755. Up to 18303 conditions per place. [2023-11-06 23:08:38,688 INFO L140 encePairwiseOnDemand]: 267/278 looper letters, 123 selfloop transitions, 25 changer transitions 0/169 dead transitions. [2023-11-06 23:08:38,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 169 transitions, 1361 flow [2023-11-06 23:08:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:08:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:08:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 730 transitions. [2023-11-06 23:08:38,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5251798561151079 [2023-11-06 23:08:38,693 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 730 transitions. [2023-11-06 23:08:38,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 730 transitions. [2023-11-06 23:08:38,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:38,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 730 transitions. [2023-11-06 23:08:38,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 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) [2023-11-06 23:08:38,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 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) [2023-11-06 23:08:38,702 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 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) [2023-11-06 23:08:38,702 INFO L175 Difference]: Start difference. First operand has 94 places, 121 transitions, 857 flow. Second operand 5 states and 730 transitions. [2023-11-06 23:08:38,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 169 transitions, 1361 flow [2023-11-06 23:08:38,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 169 transitions, 1327 flow, removed 17 selfloop flow, removed 0 redundant places. [2023-11-06 23:08:38,774 INFO L231 Difference]: Finished difference. Result has 99 places, 126 transitions, 953 flow [2023-11-06 23:08:38,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=953, PETRI_PLACES=99, PETRI_TRANSITIONS=126} [2023-11-06 23:08:38,776 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 30 predicate places. [2023-11-06 23:08:38,776 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 126 transitions, 953 flow [2023-11-06 23:08:38,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 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) [2023-11-06 23:08:38,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:38,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:38,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:08:38,777 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-06 23:08:38,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:38,778 INFO L85 PathProgramCache]: Analyzing trace with hash -984228414, now seen corresponding path program 1 times [2023-11-06 23:08:38,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:38,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603287855] [2023-11-06 23:08:38,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:38,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:39,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:39,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603287855] [2023-11-06 23:08:39,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603287855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:39,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:39,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:08:39,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828385457] [2023-11-06 23:08:39,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:39,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:08:39,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:39,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:08:39,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:08:39,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 278 [2023-11-06 23:08:39,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 126 transitions, 953 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 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) [2023-11-06 23:08:39,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:39,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 278 [2023-11-06 23:08:39,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:42,776 INFO L124 PetriNetUnfolderBase]: 20022/31191 cut-off events. [2023-11-06 23:08:42,776 INFO L125 PetriNetUnfolderBase]: For 107984/110358 co-relation queries the response was YES. [2023-11-06 23:08:42,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109429 conditions, 31191 events. 20022/31191 cut-off events. For 107984/110358 co-relation queries the response was YES. Maximal size of possible extension queue 936. Compared 224843 event pairs, 4504 based on Foata normal form. 1218/31281 useless extension candidates. Maximal degree in co-relation 70453. Up to 19133 conditions per place. [2023-11-06 23:08:42,986 INFO L140 encePairwiseOnDemand]: 263/278 looper letters, 172 selfloop transitions, 54 changer transitions 0/244 dead transitions. [2023-11-06 23:08:42,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 244 transitions, 2015 flow [2023-11-06 23:08:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:08:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:08:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 892 transitions. [2023-11-06 23:08:42,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5347721822541966 [2023-11-06 23:08:42,990 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 892 transitions. [2023-11-06 23:08:42,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 892 transitions. [2023-11-06 23:08:42,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:42,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 892 transitions. [2023-11-06 23:08:42,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 148.66666666666666) internal successors, (892), 6 states have internal predecessors, (892), 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) [2023-11-06 23:08:42,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 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) [2023-11-06 23:08:43,000 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 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) [2023-11-06 23:08:43,000 INFO L175 Difference]: Start difference. First operand has 99 places, 126 transitions, 953 flow. Second operand 6 states and 892 transitions. [2023-11-06 23:08:43,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 244 transitions, 2015 flow [2023-11-06 23:08:43,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 244 transitions, 1974 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-06 23:08:43,109 INFO L231 Difference]: Finished difference. Result has 106 places, 155 transitions, 1444 flow [2023-11-06 23:08:43,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1444, PETRI_PLACES=106, PETRI_TRANSITIONS=155} [2023-11-06 23:08:43,110 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 37 predicate places. [2023-11-06 23:08:43,110 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 155 transitions, 1444 flow [2023-11-06 23:08:43,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 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) [2023-11-06 23:08:43,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:43,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:43,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:08:43,111 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-06 23:08:43,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:43,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1623840268, now seen corresponding path program 1 times [2023-11-06 23:08:43,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:43,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888791868] [2023-11-06 23:08:43,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:43,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:43,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:43,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888791868] [2023-11-06 23:08:43,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888791868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:43,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:43,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:08:43,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292482700] [2023-11-06 23:08:43,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:43,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:08:43,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:43,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:08:43,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:08:43,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 278 [2023-11-06 23:08:43,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 155 transitions, 1444 flow. Second operand has 7 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 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) [2023-11-06 23:08:43,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:43,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 278 [2023-11-06 23:08:43,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:48,169 INFO L124 PetriNetUnfolderBase]: 21865/33787 cut-off events. [2023-11-06 23:08:48,169 INFO L125 PetriNetUnfolderBase]: For 170906/172246 co-relation queries the response was YES. [2023-11-06 23:08:48,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132208 conditions, 33787 events. 21865/33787 cut-off events. For 170906/172246 co-relation queries the response was YES. Maximal size of possible extension queue 1060. Compared 244129 event pairs, 6694 based on Foata normal form. 490/33260 useless extension candidates. Maximal degree in co-relation 90598. Up to 24979 conditions per place. [2023-11-06 23:08:48,424 INFO L140 encePairwiseOnDemand]: 262/278 looper letters, 200 selfloop transitions, 50 changer transitions 0/264 dead transitions. [2023-11-06 23:08:48,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 264 transitions, 2556 flow [2023-11-06 23:08:48,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:08:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:08:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1021 transitions. [2023-11-06 23:08:48,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5246659815005139 [2023-11-06 23:08:48,430 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1021 transitions. [2023-11-06 23:08:48,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1021 transitions. [2023-11-06 23:08:48,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:48,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1021 transitions. [2023-11-06 23:08:48,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.85714285714286) internal successors, (1021), 7 states have internal predecessors, (1021), 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) [2023-11-06 23:08:48,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 278.0) internal successors, (2224), 8 states have internal predecessors, (2224), 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) [2023-11-06 23:08:48,440 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 278.0) internal successors, (2224), 8 states have internal predecessors, (2224), 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) [2023-11-06 23:08:48,440 INFO L175 Difference]: Start difference. First operand has 106 places, 155 transitions, 1444 flow. Second operand 7 states and 1021 transitions. [2023-11-06 23:08:48,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 264 transitions, 2556 flow [2023-11-06 23:08:48,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 264 transitions, 2534 flow, removed 11 selfloop flow, removed 0 redundant places. [2023-11-06 23:08:48,812 INFO L231 Difference]: Finished difference. Result has 116 places, 171 transitions, 1831 flow [2023-11-06 23:08:48,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1831, PETRI_PLACES=116, PETRI_TRANSITIONS=171} [2023-11-06 23:08:48,814 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 47 predicate places. [2023-11-06 23:08:48,814 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 171 transitions, 1831 flow [2023-11-06 23:08:48,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 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) [2023-11-06 23:08:48,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:48,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:48,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:08:48,816 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-06 23:08:48,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1162915074, now seen corresponding path program 1 times [2023-11-06 23:08:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:48,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250120174] [2023-11-06 23:08:48,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:48,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:49,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:49,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250120174] [2023-11-06 23:08:49,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250120174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:49,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:49,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:08:49,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328163394] [2023-11-06 23:08:49,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:49,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:08:49,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:49,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:08:49,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:08:49,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 278 [2023-11-06 23:08:49,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 171 transitions, 1831 flow. Second operand has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 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) [2023-11-06 23:08:49,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:49,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 278 [2023-11-06 23:08:49,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:54,505 INFO L124 PetriNetUnfolderBase]: 23301/36518 cut-off events. [2023-11-06 23:08:54,505 INFO L125 PetriNetUnfolderBase]: For 264796/269053 co-relation queries the response was YES. [2023-11-06 23:08:54,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149669 conditions, 36518 events. 23301/36518 cut-off events. For 264796/269053 co-relation queries the response was YES. Maximal size of possible extension queue 1129. Compared 273198 event pairs, 8103 based on Foata normal form. 1656/36838 useless extension candidates. Maximal degree in co-relation 103520. Up to 28990 conditions per place. [2023-11-06 23:08:54,775 INFO L140 encePairwiseOnDemand]: 265/278 looper letters, 189 selfloop transitions, 34 changer transitions 0/245 dead transitions. [2023-11-06 23:08:54,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 245 transitions, 2707 flow [2023-11-06 23:08:54,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:08:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:08:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 867 transitions. [2023-11-06 23:08:54,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197841726618705 [2023-11-06 23:08:54,779 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 867 transitions. [2023-11-06 23:08:54,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 867 transitions. [2023-11-06 23:08:54,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:54,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 867 transitions. [2023-11-06 23:08:54,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 144.5) internal successors, (867), 6 states have internal predecessors, (867), 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) [2023-11-06 23:08:54,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 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) [2023-11-06 23:08:54,788 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 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) [2023-11-06 23:08:54,788 INFO L175 Difference]: Start difference. First operand has 116 places, 171 transitions, 1831 flow. Second operand 6 states and 867 transitions. [2023-11-06 23:08:54,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 245 transitions, 2707 flow [2023-11-06 23:08:55,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 245 transitions, 2657 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-11-06 23:08:55,292 INFO L231 Difference]: Finished difference. Result has 121 places, 183 transitions, 2058 flow [2023-11-06 23:08:55,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1785, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2058, PETRI_PLACES=121, PETRI_TRANSITIONS=183} [2023-11-06 23:08:55,293 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 52 predicate places. [2023-11-06 23:08:55,293 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 183 transitions, 2058 flow [2023-11-06 23:08:55,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 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) [2023-11-06 23:08:55,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:55,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:55,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:08:55,295 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-06 23:08:55,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1180056820, now seen corresponding path program 1 times [2023-11-06 23:08:55,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:55,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425611211] [2023-11-06 23:08:55,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:55,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:55,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:55,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425611211] [2023-11-06 23:08:55,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425611211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:55,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:55,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:08:55,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138031371] [2023-11-06 23:08:55,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:55,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:08:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:55,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:08:55,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:08:55,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 278 [2023-11-06 23:08:55,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 183 transitions, 2058 flow. Second operand has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 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) [2023-11-06 23:08:55,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:55,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 278 [2023-11-06 23:08:55,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:09:00,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][143], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 190#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 94#L191-2true, 265#true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 225#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 183#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 215#(= ~i~0 0), 22#L139true, 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), 29#L109true, Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:00,099 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-06 23:09:00,099 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 23:09:00,099 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 23:09:00,099 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 23:09:00,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][143], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 190#true, 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 94#L191-2true, 265#true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 183#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 225#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 215#(= ~i~0 0), 22#L139true, 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 14#L112true, Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:00,361 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 23:09:00,361 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:09:00,361 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:09:00,361 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:09:00,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][143], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 190#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 265#true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 225#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 183#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 215#(= ~i~0 0), 22#L139true, 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), 29#L109true, Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 169#L192-1true, Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:00,363 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 23:09:00,363 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:09:00,363 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:09:00,363 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:09:00,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][143], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 190#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 265#true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 183#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 225#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 215#(= ~i~0 0), 22#L139true, 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 14#L112true, Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, 169#L192-1true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:00,928 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 23:09:00,928 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:00,928 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:00,928 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:00,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][143], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 190#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 94#L191-2true, 265#true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 183#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 225#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 215#(= ~i~0 0), 22#L139true, 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, 76#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:00,929 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 23:09:00,929 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:00,929 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:00,929 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:00,930 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][143], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 190#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 94#L191-2true, 265#true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 183#true, 225#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 128#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 215#(= ~i~0 0), 22#L139true, 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:00,930 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 23:09:00,930 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:00,930 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:00,930 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:01,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][143], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 190#true, 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 155#L119true, 94#L191-2true, 265#true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 225#true, 183#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 215#(= ~i~0 0), 22#L139true, 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:01,109 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 23:09:01,109 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:01,109 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:01,110 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:01,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([736] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][172], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 190#true, 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 94#L191-2true, 265#true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 225#true, 183#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 15#thread2EXITtrue, Black: 215#(= ~i~0 0), 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, 31#L136true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:01,110 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 23:09:01,110 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:01,110 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:01,110 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:01,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][143], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 190#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 265#true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 183#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 225#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 215#(= ~i~0 0), 22#L139true, 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, 169#L192-1true, 76#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:01,113 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 23:09:01,113 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:01,113 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:01,113 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:01,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][143], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 190#true, 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 265#true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 183#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 225#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 128#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 215#(= ~i~0 0), 22#L139true, 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, 169#L192-1true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:01,114 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 23:09:01,114 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:01,115 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:01,115 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:01,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][143], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 190#true, 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 155#L119true, 265#true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 183#true, 225#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 215#(= ~i~0 0), 22#L139true, 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 169#L192-1true, Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:01,263 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 23:09:01,263 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:09:01,263 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:09:01,263 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:09:01,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([736] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][172], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 190#true, 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 265#true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 225#true, 183#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 15#thread2EXITtrue, Black: 215#(= ~i~0 0), 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, 31#L136true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 169#L192-1true, Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:01,263 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 23:09:01,263 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:09:01,263 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:09:01,263 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:09:01,800 INFO L124 PetriNetUnfolderBase]: 26652/41365 cut-off events. [2023-11-06 23:09:01,800 INFO L125 PetriNetUnfolderBase]: For 339823/344879 co-relation queries the response was YES. [2023-11-06 23:09:02,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174926 conditions, 41365 events. 26652/41365 cut-off events. For 339823/344879 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 311264 event pairs, 9481 based on Foata normal form. 1165/40807 useless extension candidates. Maximal degree in co-relation 126277. Up to 33286 conditions per place. [2023-11-06 23:09:02,179 INFO L140 encePairwiseOnDemand]: 265/278 looper letters, 198 selfloop transitions, 29 changer transitions 0/255 dead transitions. [2023-11-06 23:09:02,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 255 transitions, 2965 flow [2023-11-06 23:09:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:09:02,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:09:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 865 transitions. [2023-11-06 23:09:02,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185851318944844 [2023-11-06 23:09:02,183 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 865 transitions. [2023-11-06 23:09:02,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 865 transitions. [2023-11-06 23:09:02,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:09:02,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 865 transitions. [2023-11-06 23:09:02,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 144.16666666666666) internal successors, (865), 6 states have internal predecessors, (865), 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) [2023-11-06 23:09:02,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 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) [2023-11-06 23:09:02,192 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 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) [2023-11-06 23:09:02,192 INFO L175 Difference]: Start difference. First operand has 121 places, 183 transitions, 2058 flow. Second operand 6 states and 865 transitions. [2023-11-06 23:09:02,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 255 transitions, 2965 flow [2023-11-06 23:09:03,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 255 transitions, 2891 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-11-06 23:09:03,282 INFO L231 Difference]: Finished difference. Result has 125 places, 196 transitions, 2281 flow [2023-11-06 23:09:03,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1984, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2281, PETRI_PLACES=125, PETRI_TRANSITIONS=196} [2023-11-06 23:09:03,283 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 56 predicate places. [2023-11-06 23:09:03,283 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 196 transitions, 2281 flow [2023-11-06 23:09:03,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 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) [2023-11-06 23:09:03,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:09:03,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:03,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:09:03,284 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-06 23:09:03,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:03,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1180056833, now seen corresponding path program 1 times [2023-11-06 23:09:03,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:03,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798214018] [2023-11-06 23:09:03,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:03,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:03,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:09:03,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:03,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798214018] [2023-11-06 23:09:03,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798214018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:03,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:03,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:09:03,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611892615] [2023-11-06 23:09:03,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:03,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:09:03,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:03,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:09:03,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:09:03,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 278 [2023-11-06 23:09:03,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 196 transitions, 2281 flow. Second operand has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 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) [2023-11-06 23:09:03,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:09:03,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 278 [2023-11-06 23:09:03,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:09:07,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][142], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 283#true, 190#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 94#L191-2true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 183#true, 225#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(and (= ~n2~0 0) (= ~n1~0 1) (= ~n3~0 1)), Black: 215#(= ~i~0 0), 22#L139true, Black: 279#(and (= ~n2~0 ~n3~0) (<= ~n3~0 1)), 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), 29#L109true, Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), 253#true, Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), thread3Thread1of1ForFork0InUse, 241#true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:07,843 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-06 23:09:07,844 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 23:09:07,844 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 23:09:07,844 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 23:09:08,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][142], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), 283#true, Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 190#true, 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 94#L191-2true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 183#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 225#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(and (= ~n2~0 0) (= ~n1~0 1) (= ~n3~0 1)), Black: 215#(= ~i~0 0), 22#L139true, Black: 279#(and (= ~n2~0 ~n3~0) (<= ~n3~0 1)), 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), 14#L112true, Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:08,456 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 23:09:08,456 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:09:08,456 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:09:08,456 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:09:08,458 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][142], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 283#true, 190#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 183#true, 225#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(and (= ~n2~0 0) (= ~n1~0 1) (= ~n3~0 1)), Black: 215#(= ~i~0 0), 22#L139true, Black: 279#(and (= ~n2~0 ~n3~0) (<= ~n3~0 1)), 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), 29#L109true, Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), 253#true, Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), thread3Thread1of1ForFork0InUse, 241#true, 169#L192-1true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:08,458 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 23:09:08,458 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:09:08,458 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:09:08,458 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:09:08,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][142], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), 283#true, Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 190#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 183#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 225#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(and (= ~n2~0 0) (= ~n1~0 1) (= ~n3~0 1)), Black: 215#(= ~i~0 0), 22#L139true, Black: 279#(and (= ~n2~0 ~n3~0) (<= ~n3~0 1)), 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), 14#L112true, Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, 169#L192-1true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:08,666 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 23:09:08,666 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:08,666 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:08,666 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:08,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][142], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 283#true, 190#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 94#L191-2true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 183#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 225#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(and (= ~n2~0 0) (= ~n1~0 1) (= ~n3~0 1)), Black: 215#(= ~i~0 0), Black: 279#(and (= ~n2~0 ~n3~0) (<= ~n3~0 1)), 22#L139true, 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, 76#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:08,667 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 23:09:08,667 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:08,667 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:08,667 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:08,668 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][142], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 283#true, 190#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 94#L191-2true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 183#true, 225#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(and (= ~n2~0 0) (= ~n1~0 1) (= ~n3~0 1)), 128#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 215#(= ~i~0 0), 22#L139true, Black: 279#(and (= ~n2~0 ~n3~0) (<= ~n3~0 1)), 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), 253#true, Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), thread3Thread1of1ForFork0InUse, 241#true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:08,668 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 23:09:08,668 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:08,668 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:08,668 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:09:08,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([736] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][168], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 283#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 190#true, 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 94#L191-2true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 225#true, 183#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), 15#thread2EXITtrue, Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(and (= ~n2~0 0) (= ~n1~0 1) (= ~n3~0 1)), Black: 215#(= ~i~0 0), Black: 279#(and (= ~n2~0 ~n3~0) (<= ~n3~0 1)), 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, 31#L136true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:08,888 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 23:09:08,888 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:08,888 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:08,888 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:08,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][142], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 283#true, 190#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 155#L119true, 94#L191-2true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 183#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 225#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(and (= ~n2~0 0) (= ~n1~0 1) (= ~n3~0 1)), Black: 215#(= ~i~0 0), Black: 279#(and (= ~n2~0 ~n3~0) (<= ~n3~0 1)), 22#L139true, 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), 253#true, Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), thread3Thread1of1ForFork0InUse, 241#true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:08,888 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 23:09:08,888 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:08,888 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:08,888 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:08,890 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][142], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 283#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 190#true, 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 183#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 225#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(and (= ~n2~0 0) (= ~n1~0 1) (= ~n3~0 1)), Black: 215#(= ~i~0 0), 22#L139true, Black: 279#(and (= ~n2~0 ~n3~0) (<= ~n3~0 1)), 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), 253#true, Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), thread3Thread1of1ForFork0InUse, 241#true, 169#L192-1true, 76#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:08,890 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 23:09:08,891 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:08,891 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:08,891 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:08,891 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][142], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 283#true, 190#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 183#true, 225#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(and (= ~n2~0 0) (= ~n1~0 1) (= ~n3~0 1)), 128#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 215#(= ~i~0 0), 22#L139true, Black: 279#(and (= ~n2~0 ~n3~0) (<= ~n3~0 1)), 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), 253#true, Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), thread3Thread1of1ForFork0InUse, 241#true, 169#L192-1true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:08,891 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 23:09:08,891 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:08,892 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:08,892 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:09:09,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([736] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][168], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 283#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 190#true, 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), 225#true, 183#true, Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), 15#thread2EXITtrue, Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(and (= ~n2~0 0) (= ~n1~0 1) (= ~n3~0 1)), Black: 215#(= ~i~0 0), Black: 279#(and (= ~n2~0 ~n3~0) (<= ~n3~0 1)), 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), 253#true, thread3Thread1of1ForFork0InUse, 241#true, 169#L192-1true, 31#L136true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:09,044 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 23:09:09,044 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:09:09,044 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:09:09,044 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:09:09,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][142], [Black: 193#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 192#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 257#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 259#(and (<= 1 ~n3~0) (<= ~n2~0 ~n3~0)), 283#true, 190#true, Black: 258#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 274#true, Black: 201#(and (= ~n2~0 1) (= ~n3~0 0)), 155#L119true, Black: 269#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), 225#true, 183#true, Black: 270#(and (<= ~n2~0 1) (= ~n2~0 ~n3~0)), Black: 208#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 207#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 206#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 278#(and (= ~n2~0 0) (= ~n1~0 1) (= ~n3~0 1)), Black: 215#(= ~i~0 0), Black: 279#(and (= ~n2~0 ~n3~0) (<= ~n3~0 1)), 22#L139true, 204#true, Black: 222#(and (= ~n2~0 0) (<= 1 ~n3~0)), Black: 227#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 229#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 228#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), 253#true, Black: 238#(and (= ~n2~0 0) (= ~n3~0 1)), thread3Thread1of1ForFork0InUse, 241#true, 169#L192-1true, Black: 243#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 244#(and (= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 245#(and (= ~n1~0 1) (= ~n2~0 1) (= ~n3~0 0)), Black: 246#(and (<= ~n2~0 ~n3~0) (<= ~n3~0 1)), Black: 185#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 186#(or (and (= ~n3~0 0) (<= (+ ~n1~0 1) 0)) (and (= ~n1~0 0) (<= ~n3~0 0)))]) [2023-11-06 23:09:09,044 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 23:09:09,044 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:09:09,045 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:09:09,045 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:09:09,527 INFO L124 PetriNetUnfolderBase]: 26365/40834 cut-off events. [2023-11-06 23:09:09,527 INFO L125 PetriNetUnfolderBase]: For 335405/340037 co-relation queries the response was YES. [2023-11-06 23:09:09,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176523 conditions, 40834 events. 26365/40834 cut-off events. For 335405/340037 co-relation queries the response was YES. Maximal size of possible extension queue 1271. Compared 305775 event pairs, 9675 based on Foata normal form. 873/39968 useless extension candidates. Maximal degree in co-relation 126975. Up to 37676 conditions per place. [2023-11-06 23:09:10,227 INFO L140 encePairwiseOnDemand]: 268/278 looper letters, 186 selfloop transitions, 25 changer transitions 0/239 dead transitions. [2023-11-06 23:09:10,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 239 transitions, 2971 flow [2023-11-06 23:09:10,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:09:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:09:10,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 843 transitions. [2023-11-06 23:09:10,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053956834532374 [2023-11-06 23:09:10,232 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 843 transitions. [2023-11-06 23:09:10,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 843 transitions. [2023-11-06 23:09:10,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:09:10,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 843 transitions. [2023-11-06 23:09:10,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 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) [2023-11-06 23:09:10,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 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) [2023-11-06 23:09:10,241 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 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) [2023-11-06 23:09:10,241 INFO L175 Difference]: Start difference. First operand has 125 places, 196 transitions, 2281 flow. Second operand 6 states and 843 transitions. [2023-11-06 23:09:10,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 239 transitions, 2971 flow [2023-11-06 23:09:11,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 239 transitions, 2835 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-11-06 23:09:11,236 INFO L231 Difference]: Finished difference. Result has 129 places, 202 transitions, 2336 flow [2023-11-06 23:09:11,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=2164, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2336, PETRI_PLACES=129, PETRI_TRANSITIONS=202} [2023-11-06 23:09:11,238 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 60 predicate places. [2023-11-06 23:09:11,238 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 202 transitions, 2336 flow [2023-11-06 23:09:11,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 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) [2023-11-06 23:09:11,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:09:11,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:11,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:09:11,239 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-06 23:09:11,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:11,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2093475096, now seen corresponding path program 1 times [2023-11-06 23:09:11,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:11,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503948259] [2023-11-06 23:09:11,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:11,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:09:11,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:11,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503948259] [2023-11-06 23:09:11,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503948259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:11,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:11,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:09:11,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025613499] [2023-11-06 23:09:11,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:11,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:09:11,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:11,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:09:11,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:09:11,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 278 [2023-11-06 23:09:11,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 202 transitions, 2336 flow. Second operand has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 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) [2023-11-06 23:09:11,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:09:11,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 278 [2023-11-06 23:09:11,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand