./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8 --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 a8bcba962b15df67a0e136eef2e702f216cc120b7626a7b8dc8877f6ecaf3765 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 19:31:12,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:31:12,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:31:12,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:31:12,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:31:12,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:31:12,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:31:12,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:31:12,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:31:12,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:31:12,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:31:12,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:31:12,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:31:12,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:31:12,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:31:12,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:31:12,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:31:12,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:31:12,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:31:12,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:31:12,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:31:12,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:31:12,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:31:12,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:31:12,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:31:12,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:31:12,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:31:12,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:31:12,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:31:12,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:31:12,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:31:12,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:31:12,429 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:31:12,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:31:12,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:31:12,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:31:12,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:31:12,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:31:12,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:31:12,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:31:12,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:31:12,434 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 19:31:12,463 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:31:12,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:31:12,463 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:31:12,463 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:31:12,464 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:31:12,464 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:31:12,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:31:12,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:31:12,465 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:31:12,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:31:12,466 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:31:12,466 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 19:31:12,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:31:12,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:31:12,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:31:12,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 19:31:12,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:31:12,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 19:31:12,467 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 19:31:12,468 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:31:12,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:31:12,468 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:31:12,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 19:31:12,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:31:12,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:31:12,469 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:31:12,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:31:12,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:31:12,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:31:12,469 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 19:31:12,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:31:12,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:31:12,470 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:31:12,470 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 19:31:12,470 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:31:12,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:31:12,471 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:31:12,471 INFO L138 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_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/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_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8 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 -> a8bcba962b15df67a0e136eef2e702f216cc120b7626a7b8dc8877f6ecaf3765 [2022-12-13 19:31:12,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:31:12,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:31:12,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:31:12,663 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:31:12,663 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:31:12,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i [2022-12-13 19:31:15,192 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:31:15,389 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:31:15,390 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i [2022-12-13 19:31:15,400 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/data/e61346f5d/028b72d2a096444fb70d7f4b0b0f74b2/FLAG081cab0c7 [2022-12-13 19:31:15,748 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/data/e61346f5d/028b72d2a096444fb70d7f4b0b0f74b2 [2022-12-13 19:31:15,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:31:15,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:31:15,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:31:15,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:31:15,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:31:15,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:31:15" (1/1) ... [2022-12-13 19:31:15,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38558953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:15, skipping insertion in model container [2022-12-13 19:31:15,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:31:15" (1/1) ... [2022-12-13 19:31:15,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:31:15,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:31:15,986 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i[30726,30739] [2022-12-13 19:31:15,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:31:15,999 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:31:16,029 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i[30726,30739] [2022-12-13 19:31:16,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:31:16,054 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:31:16,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:16 WrapperNode [2022-12-13 19:31:16,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:31:16,055 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:31:16,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:31:16,056 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:31:16,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:16" (1/1) ... [2022-12-13 19:31:16,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:16" (1/1) ... [2022-12-13 19:31:16,089 INFO L138 Inliner]: procedures = 171, calls = 26, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 93 [2022-12-13 19:31:16,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:31:16,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:31:16,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:31:16,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:31:16,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:16" (1/1) ... [2022-12-13 19:31:16,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:16" (1/1) ... [2022-12-13 19:31:16,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:16" (1/1) ... [2022-12-13 19:31:16,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:16" (1/1) ... [2022-12-13 19:31:16,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:16" (1/1) ... [2022-12-13 19:31:16,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:16" (1/1) ... [2022-12-13 19:31:16,107 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:16" (1/1) ... [2022-12-13 19:31:16,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:16" (1/1) ... [2022-12-13 19:31:16,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:31:16,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:31:16,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:31:16,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:31:16,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:16" (1/1) ... [2022-12-13 19:31:16,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:31:16,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:31:16,142 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:31:16,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:31:16,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 19:31:16,177 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-12-13 19:31:16,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-12-13 19:31:16,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 19:31:16,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:31:16,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 19:31:16,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 19:31:16,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:31:16,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:31:16,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:31:16,180 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 19:31:16,282 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:31:16,283 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:31:16,440 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:31:16,519 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:31:16,519 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 19:31:16,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:31:16 BoogieIcfgContainer [2022-12-13 19:31:16,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:31:16,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:31:16,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:31:16,528 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:31:16,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:31:15" (1/3) ... [2022-12-13 19:31:16,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2680597d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:31:16, skipping insertion in model container [2022-12-13 19:31:16,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:31:16" (2/3) ... [2022-12-13 19:31:16,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2680597d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:31:16, skipping insertion in model container [2022-12-13 19:31:16,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:31:16" (3/3) ... [2022-12-13 19:31:16,530 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2022-12-13 19:31:16,536 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 19:31:16,545 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:31:16,545 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-12-13 19:31:16,545 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 19:31:16,591 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 19:31:16,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 92 transitions, 189 flow [2022-12-13 19:31:16,664 INFO L130 PetriNetUnfolder]: 7/103 cut-off events. [2022-12-13 19:31:16,664 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:31:16,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 103 events. 7/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 128 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2022-12-13 19:31:16,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 92 transitions, 189 flow [2022-12-13 19:31:16,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 92 transitions, 189 flow [2022-12-13 19:31:16,676 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 19:31:16,686 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 92 transitions, 189 flow [2022-12-13 19:31:16,688 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 92 transitions, 189 flow [2022-12-13 19:31:16,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 92 transitions, 189 flow [2022-12-13 19:31:16,716 INFO L130 PetriNetUnfolder]: 7/103 cut-off events. [2022-12-13 19:31:16,716 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:31:16,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 103 events. 7/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 128 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2022-12-13 19:31:16,719 INFO L119 LiptonReduction]: Number of co-enabled transitions 1680 [2022-12-13 19:31:18,075 INFO L134 LiptonReduction]: Checked pairs total: 2550 [2022-12-13 19:31:18,076 INFO L136 LiptonReduction]: Total number of compositions: 85 [2022-12-13 19:31:18,088 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:31:18,093 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;@29b8dc0e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:31:18,093 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-12-13 19:31:18,096 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-13 19:31:18,096 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:31:18,096 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:31:18,097 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 19:31:18,097 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-12-13 19:31:18,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:31:18,103 INFO L85 PathProgramCache]: Analyzing trace with hash 463796378, now seen corresponding path program 1 times [2022-12-13 19:31:18,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:31:18,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549431675] [2022-12-13 19:31:18,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:31:18,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:31:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:31:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:31:18,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:31:18,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549431675] [2022-12-13 19:31:18,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549431675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:31:18,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:31:18,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:31:18,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869522786] [2022-12-13 19:31:18,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:31:18,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 19:31:18,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:31:18,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 19:31:18,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 19:31:18,293 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 177 [2022-12-13 19:31:18,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 61 flow. Second operand has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:18,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:31:18,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 177 [2022-12-13 19:31:18,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:31:18,345 INFO L130 PetriNetUnfolder]: 35/89 cut-off events. [2022-12-13 19:31:18,345 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:31:18,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 89 events. 35/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 262 event pairs, 29 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 164. Up to 85 conditions per place. [2022-12-13 19:31:18,347 INFO L137 encePairwiseOnDemand]: 172/177 looper letters, 20 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2022-12-13 19:31:18,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 91 flow [2022-12-13 19:31:18,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 19:31:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 19:31:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 175 transitions. [2022-12-13 19:31:18,360 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4943502824858757 [2022-12-13 19:31:18,361 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 175 transitions. [2022-12-13 19:31:18,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 175 transitions. [2022-12-13 19:31:18,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:31:18,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 175 transitions. [2022-12-13 19:31:18,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:18,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:18,372 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:18,373 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 61 flow. Second operand 2 states and 175 transitions. [2022-12-13 19:31:18,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 91 flow [2022-12-13 19:31:18,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 91 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 19:31:18,378 INFO L231 Difference]: Finished difference. Result has 25 places, 23 transitions, 51 flow [2022-12-13 19:31:18,380 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=51, PETRI_PLACES=25, PETRI_TRANSITIONS=23} [2022-12-13 19:31:18,383 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2022-12-13 19:31:18,383 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 23 transitions, 51 flow [2022-12-13 19:31:18,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:18,384 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:31:18,384 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2022-12-13 19:31:18,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:31:18,384 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-12-13 19:31:18,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:31:18,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1492873962, now seen corresponding path program 1 times [2022-12-13 19:31:18,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:31:18,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125159878] [2022-12-13 19:31:18,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:31:18,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:31:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:31:18,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:31:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:31:18,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:31:18,432 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 19:31:18,434 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2022-12-13 19:31:18,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2022-12-13 19:31:18,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2022-12-13 19:31:18,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2022-12-13 19:31:18,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2022-12-13 19:31:18,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2022-12-13 19:31:18,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2022-12-13 19:31:18,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2022-12-13 19:31:18,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2022-12-13 19:31:18,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2022-12-13 19:31:18,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2022-12-13 19:31:18,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2022-12-13 19:31:18,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2022-12-13 19:31:18,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2022-12-13 19:31:18,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2022-12-13 19:31:18,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2022-12-13 19:31:18,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2022-12-13 19:31:18,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2022-12-13 19:31:18,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2022-12-13 19:31:18,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2022-12-13 19:31:18,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2022-12-13 19:31:18,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 19:31:18,441 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-12-13 19:31:18,443 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 19:31:18,443 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-12-13 19:31:18,474 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 19:31:18,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 153 transitions, 318 flow [2022-12-13 19:31:18,497 INFO L130 PetriNetUnfolder]: 13/177 cut-off events. [2022-12-13 19:31:18,497 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 19:31:18,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 13/177 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 451 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 133. Up to 6 conditions per place. [2022-12-13 19:31:18,499 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 153 transitions, 318 flow [2022-12-13 19:31:18,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 153 transitions, 318 flow [2022-12-13 19:31:18,500 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 19:31:18,500 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 153 transitions, 318 flow [2022-12-13 19:31:18,501 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 153 transitions, 318 flow [2022-12-13 19:31:18,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 153 transitions, 318 flow [2022-12-13 19:31:18,516 INFO L130 PetriNetUnfolder]: 13/177 cut-off events. [2022-12-13 19:31:18,516 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 19:31:18,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 13/177 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 451 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 133. Up to 6 conditions per place. [2022-12-13 19:31:18,520 INFO L119 LiptonReduction]: Number of co-enabled transitions 10680 [2022-12-13 19:31:19,587 INFO L134 LiptonReduction]: Checked pairs total: 32717 [2022-12-13 19:31:19,587 INFO L136 LiptonReduction]: Total number of compositions: 116 [2022-12-13 19:31:19,589 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:31:19,589 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;@29b8dc0e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:31:19,589 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-12-13 19:31:19,591 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-13 19:31:19,591 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 19:31:19,591 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:31:19,591 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:31:19,591 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-12-13 19:31:19,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:31:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash 47510154, now seen corresponding path program 1 times [2022-12-13 19:31:19,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:31:19,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43500254] [2022-12-13 19:31:19,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:31:19,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:31:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:31:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:31:19,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:31:19,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43500254] [2022-12-13 19:31:19,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43500254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:31:19,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:31:19,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:31:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370759374] [2022-12-13 19:31:19,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:31:19,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:31:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:31:19,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:31:19,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:31:19,651 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 269 [2022-12-13 19:31:19,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:19,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:31:19,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 269 [2022-12-13 19:31:19,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:31:19,873 INFO L130 PetriNetUnfolder]: 1192/2207 cut-off events. [2022-12-13 19:31:19,873 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-13 19:31:19,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4282 conditions, 2207 events. 1192/2207 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14621 event pairs, 585 based on Foata normal form. 40/1638 useless extension candidates. Maximal degree in co-relation 3808. Up to 1982 conditions per place. [2022-12-13 19:31:19,883 INFO L137 encePairwiseOnDemand]: 248/269 looper letters, 44 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2022-12-13 19:31:19,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 231 flow [2022-12-13 19:31:19,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:31:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:31:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-12-13 19:31:19,888 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.540272614622057 [2022-12-13 19:31:19,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2022-12-13 19:31:19,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2022-12-13 19:31:19,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:31:19,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2022-12-13 19:31:19,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:19,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:19,896 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:19,896 INFO L175 Difference]: Start difference. First operand has 68 places, 68 transitions, 148 flow. Second operand 3 states and 436 transitions. [2022-12-13 19:31:19,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 231 flow [2022-12-13 19:31:19,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 229 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 19:31:19,898 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 147 flow [2022-12-13 19:31:19,898 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2022-12-13 19:31:19,899 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2022-12-13 19:31:19,899 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 147 flow [2022-12-13 19:31:19,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:19,899 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:31:19,899 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:31:19,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 19:31:19,899 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-12-13 19:31:19,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:31:19,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1587354831, now seen corresponding path program 1 times [2022-12-13 19:31:19,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:31:19,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170780265] [2022-12-13 19:31:19,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:31:19,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:31:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:31:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:31:20,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:31:20,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170780265] [2022-12-13 19:31:20,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170780265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:31:20,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:31:20,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:31:20,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573772460] [2022-12-13 19:31:20,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:31:20,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:31:20,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:31:20,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:31:20,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:31:20,090 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 269 [2022-12-13 19:31:20,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:20,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:31:20,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 269 [2022-12-13 19:31:20,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:31:20,371 INFO L130 PetriNetUnfolder]: 1390/2617 cut-off events. [2022-12-13 19:31:20,372 INFO L131 PetriNetUnfolder]: For 166/170 co-relation queries the response was YES. [2022-12-13 19:31:20,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5539 conditions, 2617 events. 1390/2617 cut-off events. For 166/170 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 17524 event pairs, 310 based on Foata normal form. 4/1948 useless extension candidates. Maximal degree in co-relation 4265. Up to 2130 conditions per place. [2022-12-13 19:31:20,382 INFO L137 encePairwiseOnDemand]: 260/269 looper letters, 59 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2022-12-13 19:31:20,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 337 flow [2022-12-13 19:31:20,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:31:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:31:20,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2022-12-13 19:31:20,384 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.491635687732342 [2022-12-13 19:31:20,385 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2022-12-13 19:31:20,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2022-12-13 19:31:20,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:31:20,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2022-12-13 19:31:20,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:20,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:20,388 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:20,389 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 147 flow. Second operand 4 states and 529 transitions. [2022-12-13 19:31:20,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 337 flow [2022-12-13 19:31:20,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 77 transitions, 334 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:31:20,390 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 182 flow [2022-12-13 19:31:20,390 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2022-12-13 19:31:20,391 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2022-12-13 19:31:20,391 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 182 flow [2022-12-13 19:31:20,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:20,391 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:31:20,391 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-12-13 19:31:20,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 19:31:20,391 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-12-13 19:31:20,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:31:20,392 INFO L85 PathProgramCache]: Analyzing trace with hash 222985839, now seen corresponding path program 1 times [2022-12-13 19:31:20,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:31:20,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653781171] [2022-12-13 19:31:20,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:31:20,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:31:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:31:20,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:31:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:31:20,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:31:20,408 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 19:31:20,408 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2022-12-13 19:31:20,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 31 remaining) [2022-12-13 19:31:20,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 31 remaining) [2022-12-13 19:31:20,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 31 remaining) [2022-12-13 19:31:20,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 31 remaining) [2022-12-13 19:31:20,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 31 remaining) [2022-12-13 19:31:20,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 31 remaining) [2022-12-13 19:31:20,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 31 remaining) [2022-12-13 19:31:20,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 31 remaining) [2022-12-13 19:31:20,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 31 remaining) [2022-12-13 19:31:20,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 31 remaining) [2022-12-13 19:31:20,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 31 remaining) [2022-12-13 19:31:20,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 31 remaining) [2022-12-13 19:31:20,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 31 remaining) [2022-12-13 19:31:20,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 31 remaining) [2022-12-13 19:31:20,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 31 remaining) [2022-12-13 19:31:20,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 31 remaining) [2022-12-13 19:31:20,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 31 remaining) [2022-12-13 19:31:20,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 31 remaining) [2022-12-13 19:31:20,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 31 remaining) [2022-12-13 19:31:20,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 31 remaining) [2022-12-13 19:31:20,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 31 remaining) [2022-12-13 19:31:20,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 31 remaining) [2022-12-13 19:31:20,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 31 remaining) [2022-12-13 19:31:20,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 31 remaining) [2022-12-13 19:31:20,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 31 remaining) [2022-12-13 19:31:20,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 31 remaining) [2022-12-13 19:31:20,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 31 remaining) [2022-12-13 19:31:20,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 31 remaining) [2022-12-13 19:31:20,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 31 remaining) [2022-12-13 19:31:20,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 31 remaining) [2022-12-13 19:31:20,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 19:31:20,411 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-13 19:31:20,412 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 19:31:20,412 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-12-13 19:31:20,437 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 19:31:20,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 214 transitions, 449 flow [2022-12-13 19:31:20,462 INFO L130 PetriNetUnfolder]: 19/251 cut-off events. [2022-12-13 19:31:20,462 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 19:31:20,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 251 events. 19/251 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 821 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 193. Up to 8 conditions per place. [2022-12-13 19:31:20,463 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 214 transitions, 449 flow [2022-12-13 19:31:20,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 214 transitions, 449 flow [2022-12-13 19:31:20,465 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 19:31:20,466 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 214 transitions, 449 flow [2022-12-13 19:31:20,466 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 214 transitions, 449 flow [2022-12-13 19:31:20,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 214 transitions, 449 flow [2022-12-13 19:31:20,487 INFO L130 PetriNetUnfolder]: 19/251 cut-off events. [2022-12-13 19:31:20,488 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 19:31:20,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 251 events. 19/251 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 821 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 193. Up to 8 conditions per place. [2022-12-13 19:31:20,497 INFO L119 LiptonReduction]: Number of co-enabled transitions 27000 [2022-12-13 19:31:21,921 INFO L134 LiptonReduction]: Checked pairs total: 83933 [2022-12-13 19:31:21,921 INFO L136 LiptonReduction]: Total number of compositions: 156 [2022-12-13 19:31:21,923 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:31:21,924 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;@29b8dc0e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:31:21,924 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-12-13 19:31:21,925 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-13 19:31:21,925 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 19:31:21,926 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:31:21,926 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:31:21,926 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:31:21,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:31:21,926 INFO L85 PathProgramCache]: Analyzing trace with hash 706771895, now seen corresponding path program 1 times [2022-12-13 19:31:21,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:31:21,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176874322] [2022-12-13 19:31:21,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:31:21,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:31:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:31:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:31:21,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:31:21,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176874322] [2022-12-13 19:31:21,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176874322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:31:21,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:31:21,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:31:21,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143621494] [2022-12-13 19:31:21,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:31:21,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:31:21,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:31:21,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:31:21,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:31:21,953 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 370 [2022-12-13 19:31:21,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 98 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:21,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:31:21,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 370 [2022-12-13 19:31:21,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:31:26,340 INFO L130 PetriNetUnfolder]: 44654/65547 cut-off events. [2022-12-13 19:31:26,340 INFO L131 PetriNetUnfolder]: For 2605/2605 co-relation queries the response was YES. [2022-12-13 19:31:26,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129679 conditions, 65547 events. 44654/65547 cut-off events. For 2605/2605 co-relation queries the response was YES. Maximal size of possible extension queue 2498. Compared 516370 event pairs, 28311 based on Foata normal form. 1680/46634 useless extension candidates. Maximal degree in co-relation 110787. Up to 62302 conditions per place. [2022-12-13 19:31:26,642 INFO L137 encePairwiseOnDemand]: 341/370 looper letters, 69 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2022-12-13 19:31:26,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 90 transitions, 359 flow [2022-12-13 19:31:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:31:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:31:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 610 transitions. [2022-12-13 19:31:26,644 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5495495495495496 [2022-12-13 19:31:26,644 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 610 transitions. [2022-12-13 19:31:26,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 610 transitions. [2022-12-13 19:31:26,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:31:26,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 610 transitions. [2022-12-13 19:31:26,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:26,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:26,648 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:26,648 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 217 flow. Second operand 3 states and 610 transitions. [2022-12-13 19:31:26,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 90 transitions, 359 flow [2022-12-13 19:31:26,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 90 transitions, 351 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-13 19:31:26,652 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 219 flow [2022-12-13 19:31:26,652 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=219, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2022-12-13 19:31:26,653 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, -11 predicate places. [2022-12-13 19:31:26,653 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 219 flow [2022-12-13 19:31:26,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:26,653 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:31:26,653 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:31:26,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 19:31:26,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:31:26,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:31:26,654 INFO L85 PathProgramCache]: Analyzing trace with hash 603000185, now seen corresponding path program 1 times [2022-12-13 19:31:26,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:31:26,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582478502] [2022-12-13 19:31:26,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:31:26,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:31:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:31:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:31:26,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:31:26,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582478502] [2022-12-13 19:31:26,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582478502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:31:26,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:31:26,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:31:26,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556046550] [2022-12-13 19:31:26,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:31:26,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:31:26,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:31:26,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:31:26,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:31:26,771 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 370 [2022-12-13 19:31:26,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:26,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:31:26,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 370 [2022-12-13 19:31:26,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:31:31,218 INFO L130 PetriNetUnfolder]: 47770/70730 cut-off events. [2022-12-13 19:31:31,219 INFO L131 PetriNetUnfolder]: For 3828/3840 co-relation queries the response was YES. [2022-12-13 19:31:31,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150586 conditions, 70730 events. 47770/70730 cut-off events. For 3828/3840 co-relation queries the response was YES. Maximal size of possible extension queue 2599. Compared 563312 event pairs, 19380 based on Foata normal form. 12/49017 useless extension candidates. Maximal degree in co-relation 136411. Up to 65495 conditions per place. [2022-12-13 19:31:31,558 INFO L137 encePairwiseOnDemand]: 359/370 looper letters, 88 selfloop transitions, 8 changer transitions 0/112 dead transitions. [2022-12-13 19:31:31,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 112 transitions, 503 flow [2022-12-13 19:31:31,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:31:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:31:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 745 transitions. [2022-12-13 19:31:31,560 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5033783783783784 [2022-12-13 19:31:31,560 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 745 transitions. [2022-12-13 19:31:31,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 745 transitions. [2022-12-13 19:31:31,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:31:31,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 745 transitions. [2022-12-13 19:31:31,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.25) internal successors, (745), 4 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:31,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:31,565 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:31,565 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 219 flow. Second operand 4 states and 745 transitions. [2022-12-13 19:31:31,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 112 transitions, 503 flow [2022-12-13 19:31:31,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 112 transitions, 499 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:31:31,576 INFO L231 Difference]: Finished difference. Result has 90 places, 88 transitions, 266 flow [2022-12-13 19:31:31,576 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=90, PETRI_TRANSITIONS=88} [2022-12-13 19:31:31,576 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, -8 predicate places. [2022-12-13 19:31:31,576 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 88 transitions, 266 flow [2022-12-13 19:31:31,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:31,577 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:31:31,577 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:31:31,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 19:31:31,577 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:31:31,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:31:31,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2044872109, now seen corresponding path program 1 times [2022-12-13 19:31:31,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:31:31,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556725183] [2022-12-13 19:31:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:31:31,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:31:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:31:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:31:31,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:31:31,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556725183] [2022-12-13 19:31:31,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556725183] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:31:31,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649096540] [2022-12-13 19:31:31,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:31:31,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:31:31,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:31:31,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:31:31,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 19:31:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:31:31,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 19:31:31,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:31:31,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 19:31:31,900 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 19:31:31,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 19:31:31,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 19:31:31,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 19:31:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:31:31,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:31:32,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:31:32,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 62 [2022-12-13 19:31:32,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:31:32,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2022-12-13 19:31:32,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2022-12-13 19:31:32,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 19:31:32,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 19:31:32,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2022-12-13 19:31:32,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-12-13 19:31:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:31:32,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649096540] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:31:32,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:31:32,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-13 19:31:32,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406410967] [2022-12-13 19:31:32,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:31:32,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:31:32,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:31:32,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:31:32,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2022-12-13 19:31:32,685 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 370 [2022-12-13 19:31:32,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 88 transitions, 266 flow. Second operand has 14 states, 14 states have (on average 134.71428571428572) internal successors, (1886), 14 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:32,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:31:32,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 370 [2022-12-13 19:31:32,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:31:48,019 INFO L130 PetriNetUnfolder]: 120937/179020 cut-off events. [2022-12-13 19:31:48,020 INFO L131 PetriNetUnfolder]: For 50861/50861 co-relation queries the response was YES. [2022-12-13 19:31:48,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436863 conditions, 179020 events. 120937/179020 cut-off events. For 50861/50861 co-relation queries the response was YES. Maximal size of possible extension queue 6560. Compared 1545940 event pairs, 17709 based on Foata normal form. 183/137959 useless extension candidates. Maximal degree in co-relation 434817. Up to 85643 conditions per place. [2022-12-13 19:31:48,895 INFO L137 encePairwiseOnDemand]: 333/370 looper letters, 526 selfloop transitions, 138 changer transitions 0/676 dead transitions. [2022-12-13 19:31:48,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 676 transitions, 3238 flow [2022-12-13 19:31:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 19:31:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 19:31:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2825 transitions. [2022-12-13 19:31:48,900 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47719594594594594 [2022-12-13 19:31:48,901 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2825 transitions. [2022-12-13 19:31:48,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2825 transitions. [2022-12-13 19:31:48,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:31:48,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2825 transitions. [2022-12-13 19:31:48,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 176.5625) internal successors, (2825), 16 states have internal predecessors, (2825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:48,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 370.0) internal successors, (6290), 17 states have internal predecessors, (6290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:48,913 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 370.0) internal successors, (6290), 17 states have internal predecessors, (6290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:48,914 INFO L175 Difference]: Start difference. First operand has 90 places, 88 transitions, 266 flow. Second operand 16 states and 2825 transitions. [2022-12-13 19:31:48,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 676 transitions, 3238 flow [2022-12-13 19:31:48,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 676 transitions, 3214 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:31:48,926 INFO L231 Difference]: Finished difference. Result has 116 places, 227 transitions, 1537 flow [2022-12-13 19:31:48,926 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1537, PETRI_PLACES=116, PETRI_TRANSITIONS=227} [2022-12-13 19:31:48,926 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 18 predicate places. [2022-12-13 19:31:48,927 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 227 transitions, 1537 flow [2022-12-13 19:31:48,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 134.71428571428572) internal successors, (1886), 14 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:48,927 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:31:48,927 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:31:48,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 19:31:49,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbdbb931-7bfd-43d9-89c9-7862a190964b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:31:49,129 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:31:49,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:31:49,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1009806701, now seen corresponding path program 1 times [2022-12-13 19:31:49,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:31:49,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112566937] [2022-12-13 19:31:49,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:31:49,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:31:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:31:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:31:49,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:31:49,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112566937] [2022-12-13 19:31:49,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112566937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:31:49,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:31:49,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:31:49,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948989745] [2022-12-13 19:31:49,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:31:49,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:31:49,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:31:49,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:31:49,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:31:49,274 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 370 [2022-12-13 19:31:49,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 227 transitions, 1537 flow. Second operand has 4 states, 4 states have (on average 163.25) internal successors, (653), 4 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:31:49,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:31:49,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 370 [2022-12-13 19:31:49,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:32:00,546 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1213] L722-9-->L708-2: Formula: (and (= (select |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) 0) (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (< |v_#StackHeapBarrier_64| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69| 0) (= |v_#valid_260| (store |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 1)) (= (store |v_#length_114| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 4) |v_#length_113|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_261|, #length=|v_#length_114|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_64|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_39|, #valid=|v_#valid_260|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_35|, #length=|v_#length_113|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_39|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_21|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][25], [Black: 308#(and (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 314#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), 8#L708-3true, Black: 316#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 302#(and (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 283#(and (or (not (< 64 ~next_alloc_idx~0)) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 276#(and (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 304#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), Black: 219#true, Black: 306#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 312#(forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))), Black: 265#(< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))), thr1Thread1of3ForFork0InUse, Black: 310#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), thr1Thread2of3ForFork0InUse, Black: 318#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), thr1Thread3of3ForFork0InUse, Black: 210#(= ~next_alloc_idx~0 1), 135#L709-2true, 31#L728-4true, Black: 216#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 129#L708-2true, 333#true]) [2022-12-13 19:32:00,546 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:32:00,546 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:32:00,546 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:32:00,546 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:32:01,558 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1213] L722-9-->L708-2: Formula: (and (= (select |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) 0) (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (< |v_#StackHeapBarrier_64| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69| 0) (= |v_#valid_260| (store |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 1)) (= (store |v_#length_114| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 4) |v_#length_113|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_261|, #length=|v_#length_114|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_64|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_39|, #valid=|v_#valid_260|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_35|, #length=|v_#length_113|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_39|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_21|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][25], [Black: 308#(and (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 314#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), 8#L708-3true, Black: 316#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 302#(and (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 283#(and (or (not (< 64 ~next_alloc_idx~0)) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 276#(and (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 304#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), Black: 219#true, 6#L710-3true, 312#(forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))), Black: 306#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 265#(< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))), thr1Thread1of3ForFork0InUse, Black: 310#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), thr1Thread2of3ForFork0InUse, Black: 318#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), thr1Thread3of3ForFork0InUse, Black: 210#(= ~next_alloc_idx~0 1), 31#L728-4true, Black: 216#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 129#L708-2true, 333#true]) [2022-12-13 19:32:01,558 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:32:01,558 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:32:01,558 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:32:01,558 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:32:01,559 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1213] L722-9-->L708-2: Formula: (and (= (select |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) 0) (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (< |v_#StackHeapBarrier_64| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69| 0) (= |v_#valid_260| (store |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 1)) (= (store |v_#length_114| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 4) |v_#length_113|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_261|, #length=|v_#length_114|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_64|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_39|, #valid=|v_#valid_260|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_35|, #length=|v_#length_113|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_39|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_21|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][25], [Black: 308#(and (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 314#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), 8#L708-3true, Black: 316#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 302#(and (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 283#(and (or (not (< 64 ~next_alloc_idx~0)) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 276#(and (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 304#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), Black: 219#true, Black: 306#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 312#(forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))), Black: 265#(< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))), thr1Thread1of3ForFork0InUse, Black: 310#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), thr1Thread2of3ForFork0InUse, Black: 318#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), thr1Thread3of3ForFork0InUse, Black: 210#(= ~next_alloc_idx~0 1), 31#L728-4true, Black: 216#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 129#L708-2true, 333#true, 163#L3true]) [2022-12-13 19:32:01,559 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:32:01,559 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:32:01,559 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:32:01,560 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:32:02,216 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1213] L722-9-->L708-2: Formula: (and (= (select |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) 0) (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (< |v_#StackHeapBarrier_64| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69| 0) (= |v_#valid_260| (store |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 1)) (= (store |v_#length_114| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 4) |v_#length_113|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_261|, #length=|v_#length_114|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_64|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_39|, #valid=|v_#valid_260|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_35|, #length=|v_#length_113|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_39|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_21|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][25], [Black: 308#(and (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 314#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), 8#L708-3true, Black: 316#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 302#(and (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 283#(and (or (not (< 64 ~next_alloc_idx~0)) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 312#(forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))), Black: 276#(and (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 304#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), Black: 306#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 265#(< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))), thr1Thread1of3ForFork0InUse, Black: 310#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 318#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), thr1Thread2of3ForFork0InUse, 219#true, thr1Thread3of3ForFork0InUse, Black: 210#(= ~next_alloc_idx~0 1), 138#L722-5true, 31#L728-4true, Black: 216#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 129#L708-2true, 333#true]) [2022-12-13 19:32:02,216 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:32:02,216 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:32:02,216 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:32:02,217 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:32:02,346 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1213] L722-9-->L708-2: Formula: (and (= (select |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) 0) (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (< |v_#StackHeapBarrier_64| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69| 0) (= |v_#valid_260| (store |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 1)) (= (store |v_#length_114| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 4) |v_#length_113|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_261|, #length=|v_#length_114|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_64|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_39|, #valid=|v_#valid_260|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_35|, #length=|v_#length_113|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_39|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_21|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][25], [Black: 308#(and (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 314#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), 8#L708-3true, Black: 316#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 302#(and (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 283#(and (or (not (< 64 ~next_alloc_idx~0)) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 276#(and (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 304#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), Black: 219#true, 312#(forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))), Black: 306#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 265#(< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))), thr1Thread1of3ForFork0InUse, Black: 310#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), thr1Thread2of3ForFork0InUse, 173#L713-1true, Black: 318#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), thr1Thread3of3ForFork0InUse, Black: 210#(= ~next_alloc_idx~0 1), 31#L728-4true, Black: 216#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 129#L708-2true, 333#true]) [2022-12-13 19:32:02,346 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:32:02,346 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:32:02,347 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:32:02,347 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:32:02,347 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1213] L722-9-->L708-2: Formula: (and (= (select |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) 0) (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (< |v_#StackHeapBarrier_64| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69| 0) (= |v_#valid_260| (store |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 1)) (= (store |v_#length_114| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 4) |v_#length_113|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_261|, #length=|v_#length_114|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_64|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_39|, #valid=|v_#valid_260|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_35|, #length=|v_#length_113|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_39|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_21|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][25], [Black: 308#(and (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 314#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), 8#L708-3true, Black: 316#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 302#(and (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 283#(and (or (not (< 64 ~next_alloc_idx~0)) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 276#(and (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 304#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), Black: 219#true, 312#(forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))), Black: 306#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 265#(< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))), thr1Thread1of3ForFork0InUse, 149#thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 310#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), thr1Thread2of3ForFork0InUse, Black: 318#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), thr1Thread3of3ForFork0InUse, Black: 210#(= ~next_alloc_idx~0 1), 31#L728-4true, Black: 216#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 129#L708-2true, 333#true]) [2022-12-13 19:32:02,347 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:32:02,347 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:32:02,348 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:32:02,348 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:32:02,991 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1213] L722-9-->L708-2: Formula: (and (= (select |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) 0) (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (< |v_#StackHeapBarrier_64| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69| 0) (= |v_#valid_260| (store |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 1)) (= (store |v_#length_114| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 4) |v_#length_113|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_261|, #length=|v_#length_114|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_64|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_39|, #valid=|v_#valid_260|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_35|, #length=|v_#length_113|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_39|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_21|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][25], [Black: 308#(and (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 314#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), 8#L708-3true, Black: 316#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 302#(and (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 283#(and (or (not (< 64 ~next_alloc_idx~0)) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 312#(forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))), Black: 276#(and (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 304#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), Black: 306#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 192#L722-9true, Black: 265#(< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))), thr1Thread1of3ForFork0InUse, Black: 310#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 318#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), thr1Thread2of3ForFork0InUse, 219#true, thr1Thread3of3ForFork0InUse, Black: 210#(= ~next_alloc_idx~0 1), 31#L728-4true, Black: 216#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 129#L708-2true, 333#true]) [2022-12-13 19:32:02,991 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:32:02,991 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:32:02,991 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:32:02,991 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:32:03,246 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1213] L722-9-->L708-2: Formula: (and (= (select |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) 0) (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (< |v_#StackHeapBarrier_64| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69| 0) (= |v_#valid_260| (store |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 1)) (= (store |v_#length_114| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 4) |v_#length_113|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_261|, #length=|v_#length_114|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_64|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_39|, #valid=|v_#valid_260|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_35|, #length=|v_#length_113|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_39|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_21|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][25], [Black: 308#(and (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 314#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), 8#L708-3true, Black: 316#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 302#(and (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 283#(and (or (not (< 64 ~next_alloc_idx~0)) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 276#(and (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 304#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), Black: 219#true, Black: 306#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 312#(forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))), Black: 265#(< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))), thr1Thread1of3ForFork0InUse, Black: 310#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), thr1Thread2of3ForFork0InUse, Black: 318#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), thr1Thread3of3ForFork0InUse, Black: 210#(= ~next_alloc_idx~0 1), 31#L728-4true, Black: 216#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 129#L708-2true, 333#true, 23#L713-4true]) [2022-12-13 19:32:03,246 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:32:03,246 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:32:03,246 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:32:03,246 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:32:03,874 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1213] L722-9-->L708-2: Formula: (and (= (select |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) 0) (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (< |v_#StackHeapBarrier_64| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69| 0) (= |v_#valid_260| (store |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 1)) (= (store |v_#length_114| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 4) |v_#length_113|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_261|, #length=|v_#length_114|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_64|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_39|, #valid=|v_#valid_260|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_35|, #length=|v_#length_113|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_39|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_21|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][25], [Black: 308#(and (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 314#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), 8#L708-3true, Black: 316#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 302#(and (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 283#(and (or (not (< 64 ~next_alloc_idx~0)) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 276#(and (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 304#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), Black: 219#true, 312#(forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))), Black: 306#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 265#(< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))), thr1Thread1of3ForFork0InUse, Black: 310#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), thr1Thread2of3ForFork0InUse, Black: 318#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), 54#L714-1true, thr1Thread3of3ForFork0InUse, Black: 210#(= ~next_alloc_idx~0 1), 31#L728-4true, Black: 216#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 129#L708-2true, 333#true]) [2022-12-13 19:32:03,874 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:32:03,874 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:32:03,874 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:32:03,874 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:32:04,741 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1213] L722-9-->L708-2: Formula: (and (= (select |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) 0) (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (< |v_#StackHeapBarrier_64| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69| 0) (= |v_#valid_260| (store |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 1)) (= (store |v_#length_114| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 4) |v_#length_113|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_261|, #length=|v_#length_114|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_64|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_39|, #valid=|v_#valid_260|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_35|, #length=|v_#length_113|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_39|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_21|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][25], [Black: 308#(and (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 314#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), 8#L708-3true, Black: 316#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 302#(and (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 283#(and (or (not (< 64 ~next_alloc_idx~0)) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 312#(forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))), Black: 276#(and (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 304#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), Black: 219#true, Black: 306#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 265#(< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))), thr1Thread1of3ForFork0InUse, 117#thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 318#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 310#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 210#(= ~next_alloc_idx~0 1), 31#L728-4true, Black: 216#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 129#L708-2true, 333#true]) [2022-12-13 19:32:04,741 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2022-12-13 19:32:04,742 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:32:04,742 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:32:04,742 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:32:04,800 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1213] L722-9-->L708-2: Formula: (and (= (select |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) 0) (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (< |v_#StackHeapBarrier_64| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69| 0) (= |v_#valid_260| (store |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 1)) (= (store |v_#length_114| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 4) |v_#length_113|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_261|, #length=|v_#length_114|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_64|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_39|, #valid=|v_#valid_260|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_35|, #length=|v_#length_113|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_39|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_21|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][25], [Black: 308#(and (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 314#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), 8#L708-3true, Black: 316#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 302#(and (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 283#(and (or (not (< 64 ~next_alloc_idx~0)) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 276#(and (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 304#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), Black: 219#true, 312#(forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))), Black: 306#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 265#(< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))), thr1Thread1of3ForFork0InUse, Black: 310#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), thr1Thread2of3ForFork0InUse, Black: 318#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), thr1Thread3of3ForFork0InUse, 156#L716-3true, Black: 210#(= ~next_alloc_idx~0 1), 31#L728-4true, Black: 216#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 129#L708-2true, 333#true]) [2022-12-13 19:32:04,800 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2022-12-13 19:32:04,800 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2022-12-13 19:32:04,800 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2022-12-13 19:32:04,800 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2022-12-13 19:32:04,801 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1213] L722-9-->L708-2: Formula: (and (= (select |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) 0) (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (< |v_#StackHeapBarrier_64| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69| 0) (= |v_#valid_260| (store |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 1)) (= (store |v_#length_114| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 4) |v_#length_113|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_261|, #length=|v_#length_114|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_64|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_39|, #valid=|v_#valid_260|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_35|, #length=|v_#length_113|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_39|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_21|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][25], [Black: 308#(and (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 314#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), 8#L708-3true, Black: 316#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 302#(and (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 283#(and (or (not (< 64 ~next_alloc_idx~0)) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 276#(and (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 304#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), Black: 219#true, 312#(forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))), Black: 306#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 265#(< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))), thr1Thread1of3ForFork0InUse, Black: 310#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), thr1Thread2of3ForFork0InUse, Black: 318#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), thr1Thread3of3ForFork0InUse, Black: 210#(= ~next_alloc_idx~0 1), 31#L728-4true, Black: 216#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 22#thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 129#L708-2true, 333#true]) [2022-12-13 19:32:04,801 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2022-12-13 19:32:04,801 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2022-12-13 19:32:04,801 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2022-12-13 19:32:04,801 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2022-12-13 19:32:05,549 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1213] L722-9-->L708-2: Formula: (and (= (select |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) 0) (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (< |v_#StackHeapBarrier_64| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69| 0) (= |v_#valid_260| (store |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 1)) (= (store |v_#length_114| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 4) |v_#length_113|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_261|, #length=|v_#length_114|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_64|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_39|, #valid=|v_#valid_260|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_35|, #length=|v_#length_113|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_39|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_21|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][25], [Black: 308#(and (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 314#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), 8#L708-3true, Black: 316#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 302#(and (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 283#(and (or (not (< 64 ~next_alloc_idx~0)) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 276#(and (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 304#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), Black: 219#true, 312#(forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))), Black: 306#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 265#(< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))), thr1Thread1of3ForFork0InUse, Black: 310#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), thr1Thread2of3ForFork0InUse, Black: 318#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), thr1Thread3of3ForFork0InUse, 177#L717-1true, Black: 210#(= ~next_alloc_idx~0 1), 31#L728-4true, Black: 216#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 129#L708-2true, 333#true]) [2022-12-13 19:32:05,549 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2022-12-13 19:32:05,549 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 19:32:05,549 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 19:32:05,549 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2022-12-13 19:32:05,937 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1213] L722-9-->L708-2: Formula: (and (= (select |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) 0) (= (+ |v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21| 1) 0) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| 10) (= |v_thr1Thread2of3ForFork0_push_#in~d#1_13| |v_thr1Thread2of3ForFork0_push_~d#1_19|) (< |v_#StackHeapBarrier_64| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69| 0) (= |v_#valid_260| (store |v_#valid_261| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 1)) (= (store |v_#length_114| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 4) |v_#length_113|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_261|, #length=|v_#length_114|} OutVars{thr1Thread2of3ForFork0_push_~oldTop~0#1=|v_thr1Thread2of3ForFork0_push_~oldTop~0#1_21|, #StackHeapBarrier=|v_#StackHeapBarrier_64|, thr1Thread2of3ForFork0_push_#t~mem3#1=|v_thr1Thread2of3ForFork0_push_#t~mem3#1_39|, #valid=|v_#valid_260|, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_69|, thr1Thread2of3ForFork0_push_#t~mem5#1=|v_thr1Thread2of3ForFork0_push_#t~mem5#1_35|, #length=|v_#length_113|, thr1Thread2of3ForFork0_push_#in~d#1=|v_thr1Thread2of3ForFork0_push_#in~d#1_13|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_79|, thr1Thread2of3ForFork0_push_~d#1=|v_thr1Thread2of3ForFork0_push_~d#1_19|, thr1Thread2of3ForFork0_push_#t~mem4#1=|v_thr1Thread2of3ForFork0_push_#t~mem4#1_39|, thr1Thread2of3ForFork0_push_#t~mem6#1=|v_thr1Thread2of3ForFork0_push_#t~mem6#1_21|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_push_~oldTop~0#1, thr1Thread2of3ForFork0_push_#t~mem3#1, #valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, thr1Thread2of3ForFork0_push_#t~mem5#1, #length, thr1Thread2of3ForFork0_push_#in~d#1, thr1Thread2of3ForFork0_push_~#newTop~0#1.base, thr1Thread2of3ForFork0_push_~d#1, thr1Thread2of3ForFork0_push_#t~mem4#1, thr1Thread2of3ForFork0_push_#t~mem6#1][25], [Black: 308#(and (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 314#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), 139#L718-1true, 8#L708-3true, Black: 316#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 302#(and (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 283#(and (or (not (< 64 ~next_alloc_idx~0)) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (or (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81| Int)) (not (= (select |#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_81|) 0))) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 276#(and (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), Black: 304#(and (= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), Black: 219#true, 312#(forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))), Black: 306#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= ~next_alloc_idx~0 (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~next_alloc_idx~0 1) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), Black: 265#(< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))), thr1Thread1of3ForFork0InUse, Black: 310#(and (< 0 (+ 2147483649 (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 0)) (< 64 ~next_alloc_idx~0)) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (and (not (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (< 0 (+ 2147483649 ~next_alloc_idx~0))) (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 64 ~next_alloc_idx~0))), thr1Thread2of3ForFork0InUse, Black: 318#(and (forall ((v_ArrVal_79 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (or (not (< 64 ~next_alloc_idx~0)) (not (<= ~next_alloc_idx~0 2147483646))) (or (< (+ 2147483650 ~next_alloc_idx~0) 0) (< 0 (+ 2147483649 ~next_alloc_idx~0)))), thr1Thread3of3ForFork0InUse, Black: 210#(= ~next_alloc_idx~0 1), 31#L728-4true, Black: 216#(= (select (select |#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1), 129#L708-2true, 333#true]) [2022-12-13 19:32:05,937 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2022-12-13 19:32:05,937 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-13 19:32:05,937 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-13 19:32:05,937 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-13 19:32:06,375 INFO L130 PetriNetUnfolder]: 115989/172066 cut-off events. [2022-12-13 19:32:06,375 INFO L131 PetriNetUnfolder]: For 1044050/1046385 co-relation queries the response was YES. [2022-12-13 19:32:06,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753682 conditions, 172066 events. 115989/172066 cut-off events. For 1044050/1046385 co-relation queries the response was YES. Maximal size of possible extension queue 6422. Compared 1492433 event pairs, 47994 based on Foata normal form. 1826/161801 useless extension candidates. Maximal degree in co-relation 707316. Up to 159957 conditions per place. [2022-12-13 19:32:07,717 INFO L137 encePairwiseOnDemand]: 359/370 looper letters, 221 selfloop transitions, 24 changer transitions 0/269 dead transitions. [2022-12-13 19:32:07,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 269 transitions, 2324 flow [2022-12-13 19:32:07,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:32:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:32:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 744 transitions. [2022-12-13 19:32:07,720 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5027027027027027 [2022-12-13 19:32:07,720 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 744 transitions. [2022-12-13 19:32:07,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 744 transitions. [2022-12-13 19:32:07,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:32:07,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 744 transitions. [2022-12-13 19:32:07,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:32:07,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:32:07,723 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:32:07,724 INFO L175 Difference]: Start difference. First operand has 116 places, 227 transitions, 1537 flow. Second operand 4 states and 744 transitions. [2022-12-13 19:32:07,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 269 transitions, 2324 flow [2022-12-13 19:32:14,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 269 transitions, 2255 flow, removed 29 selfloop flow, removed 1 redundant places. [2022-12-13 19:32:14,183 INFO L231 Difference]: Finished difference. Result has 119 places, 240 transitions, 1685 flow [2022-12-13 19:32:14,183 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1685, PETRI_PLACES=119, PETRI_TRANSITIONS=240} [2022-12-13 19:32:14,183 INFO L288 CegarLoopForPetriNet]: 98 programPoint places, 21 predicate places. [2022-12-13 19:32:14,183 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 240 transitions, 1685 flow [2022-12-13 19:32:14,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.25) internal successors, (653), 4 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:32:14,184 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:32:14,184 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-12-13 19:32:14,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 19:32:14,184 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-12-13 19:32:14,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:32:14,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1530014035, now seen corresponding path program 1 times [2022-12-13 19:32:14,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:32:14,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810125518] [2022-12-13 19:32:14,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:32:14,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:32:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:32:14,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:32:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:32:14,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:32:14,198 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 19:32:14,198 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 41 remaining) [2022-12-13 19:32:14,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2022-12-13 19:32:14,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2022-12-13 19:32:14,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2022-12-13 19:32:14,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2022-12-13 19:32:14,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2022-12-13 19:32:14,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2022-12-13 19:32:14,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2022-12-13 19:32:14,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2022-12-13 19:32:14,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2022-12-13 19:32:14,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2022-12-13 19:32:14,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2022-12-13 19:32:14,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2022-12-13 19:32:14,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2022-12-13 19:32:14,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2022-12-13 19:32:14,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2022-12-13 19:32:14,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2022-12-13 19:32:14,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2022-12-13 19:32:14,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2022-12-13 19:32:14,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2022-12-13 19:32:14,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2022-12-13 19:32:14,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2022-12-13 19:32:14,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2022-12-13 19:32:14,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2022-12-13 19:32:14,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2022-12-13 19:32:14,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2022-12-13 19:32:14,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2022-12-13 19:32:14,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2022-12-13 19:32:14,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2022-12-13 19:32:14,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2022-12-13 19:32:14,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2022-12-13 19:32:14,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2022-12-13 19:32:14,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2022-12-13 19:32:14,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2022-12-13 19:32:14,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2022-12-13 19:32:14,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2022-12-13 19:32:14,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2022-12-13 19:32:14,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2022-12-13 19:32:14,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2022-12-13 19:32:14,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2022-12-13 19:32:14,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2022-12-13 19:32:14,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 19:32:14,203 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-12-13 19:32:14,203 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 19:32:14,203 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-12-13 19:32:14,241 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 19:32:14,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 275 transitions, 582 flow [2022-12-13 19:32:14,294 INFO L130 PetriNetUnfolder]: 25/325 cut-off events. [2022-12-13 19:32:14,294 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 19:32:14,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 325 events. 25/325 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1212 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 259. Up to 10 conditions per place. [2022-12-13 19:32:14,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 275 transitions, 582 flow [2022-12-13 19:32:14,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 275 transitions, 582 flow [2022-12-13 19:32:14,301 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 19:32:14,301 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 275 transitions, 582 flow [2022-12-13 19:32:14,301 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 275 transitions, 582 flow [2022-12-13 19:32:14,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 275 transitions, 582 flow [2022-12-13 19:32:14,351 INFO L130 PetriNetUnfolder]: 25/325 cut-off events. [2022-12-13 19:32:14,351 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 19:32:14,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 325 events. 25/325 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1212 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 259. Up to 10 conditions per place. [2022-12-13 19:32:14,374 INFO L119 LiptonReduction]: Number of co-enabled transitions 50640 [2022-12-13 19:32:16,445 INFO L134 LiptonReduction]: Checked pairs total: 168821 [2022-12-13 19:32:16,445 INFO L136 LiptonReduction]: Total number of compositions: 205 [2022-12-13 19:32:16,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:32:16,446 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;@29b8dc0e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:32:16,446 INFO L358 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2022-12-13 19:32:16,447 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-13 19:32:16,447 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 19:32:16,447 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:32:16,448 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:32:16,448 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2022-12-13 19:32:16,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:32:16,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1441591597, now seen corresponding path program 1 times [2022-12-13 19:32:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:32:16,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556881919] [2022-12-13 19:32:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:32:16,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:32:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:32:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:32:16,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:32:16,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556881919] [2022-12-13 19:32:16,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556881919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:32:16,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:32:16,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:32:16,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7876688] [2022-12-13 19:32:16,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:32:16,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:32:16,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:32:16,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:32:16,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:32:16,467 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 480 [2022-12-13 19:32:16,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 132 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:32:16,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:32:16,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 480 [2022-12-13 19:32:16,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:34:32,419 INFO L130 PetriNetUnfolder]: 1455135/1918596 cut-off events. [2022-12-13 19:34:32,419 INFO L131 PetriNetUnfolder]: For 95434/95434 co-relation queries the response was YES. [2022-12-13 19:34:35,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3813627 conditions, 1918596 events. 1455135/1918596 cut-off events. For 95434/95434 co-relation queries the response was YES. Maximal size of possible extension queue 55130. Compared 16322639 event pairs, 1026321 based on Foata normal form. 57374/1336754 useless extension candidates. Maximal degree in co-relation 3117024. Up to 1846665 conditions per place. [2022-12-13 19:34:43,879 INFO L137 encePairwiseOnDemand]: 442/480 looper letters, 94 selfloop transitions, 5 changer transitions 0/122 dead transitions. [2022-12-13 19:34:43,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 122 transitions, 495 flow [2022-12-13 19:34:43,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:34:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:34:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 786 transitions. [2022-12-13 19:34:43,881 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2022-12-13 19:34:43,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 786 transitions. [2022-12-13 19:34:43,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 786 transitions. [2022-12-13 19:34:43,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:34:43,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 786 transitions. [2022-12-13 19:34:43,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:34:43,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 480.0) internal successors, (1920), 4 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:34:43,885 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 480.0) internal successors, (1920), 4 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:34:43,885 INFO L175 Difference]: Start difference. First operand has 130 places, 132 transitions, 296 flow. Second operand 3 states and 786 transitions. [2022-12-13 19:34:43,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 122 transitions, 495 flow [2022-12-13 19:34:43,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 122 transitions, 477 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-12-13 19:34:43,928 INFO L231 Difference]: Finished difference. Result has 115 places, 114 transitions, 295 flow [2022-12-13 19:34:43,928 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=295, PETRI_PLACES=115, PETRI_TRANSITIONS=114} [2022-12-13 19:34:43,929 INFO L288 CegarLoopForPetriNet]: 130 programPoint places, -15 predicate places. [2022-12-13 19:34:43,929 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 114 transitions, 295 flow [2022-12-13 19:34:43,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:34:43,929 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:34:43,929 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:34:43,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 19:34:43,929 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2022-12-13 19:34:43,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:34:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1904971234, now seen corresponding path program 1 times [2022-12-13 19:34:43,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:34:43,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073048729] [2022-12-13 19:34:43,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:34:43,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:34:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:34:43,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:34:43,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073048729] [2022-12-13 19:34:43,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073048729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:34:43,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:34:43,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:34:43,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530978742] [2022-12-13 19:34:43,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:34:43,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:34:43,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:34:43,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:34:43,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:34:44,041 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 480 [2022-12-13 19:34:44,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 114 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:34:44,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:34:44,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 480 [2022-12-13 19:34:44,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand