./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:32:15,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:32:15,706 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 03:32:15,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:32:15,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:32:15,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:32:15,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:32:15,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:32:15,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:32:15,743 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:32:15,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:32:15,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:32:15,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:32:15,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:32:15,746 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:32:15,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:32:15,747 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:32:15,747 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:32:15,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:32:15,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:32:15,749 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:32:15,749 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:32:15,750 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:32:15,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:32:15,751 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:32:15,751 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:32:15,752 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:32:15,752 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:32:15,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:32:15,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:32:15,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:32:15,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:32:15,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:32:15,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:32:15,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:32:15,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:32:15,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:32:15,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:32:15,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:32:15,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:32:15,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:32:15,758 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/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_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc [2023-11-29 03:32:15,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:32:15,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:32:16,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:32:16,001 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:32:16,002 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:32:16,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 03:32:18,806 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:32:19,062 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:32:19,063 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 03:32:19,080 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/data/012d3f222/7216b9f495ed41a99e461f0a51310a64/FLAGc7b5baf51 [2023-11-29 03:32:19,095 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/data/012d3f222/7216b9f495ed41a99e461f0a51310a64 [2023-11-29 03:32:19,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:32:19,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:32:19,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:32:19,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:32:19,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:32:19,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:32:19" (1/1) ... [2023-11-29 03:32:19,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f5cf92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:32:19, skipping insertion in model container [2023-11-29 03:32:19,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:32:19" (1/1) ... [2023-11-29 03:32:19,155 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:32:19,538 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:32:19,550 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:32:19,612 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:32:19,645 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:32:19,645 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:32:19,653 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:32:19,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:32:19 WrapperNode [2023-11-29 03:32:19,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:32:19,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:32:19,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:32:19,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:32:19,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:32:19" (1/1) ... [2023-11-29 03:32:19,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:32:19" (1/1) ... [2023-11-29 03:32:19,710 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-29 03:32:19,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:32:19,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:32:19,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:32:19,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:32:19,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:32:19" (1/1) ... [2023-11-29 03:32:19,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:32:19" (1/1) ... [2023-11-29 03:32:19,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:32:19" (1/1) ... [2023-11-29 03:32:19,748 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 03:32:19,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:32:19" (1/1) ... [2023-11-29 03:32:19,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:32:19" (1/1) ... [2023-11-29 03:32:19,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:32:19" (1/1) ... [2023-11-29 03:32:19,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:32:19" (1/1) ... [2023-11-29 03:32:19,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:32:19" (1/1) ... [2023-11-29 03:32:19,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:32:19" (1/1) ... [2023-11-29 03:32:19,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:32:19,773 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:32:19,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:32:19,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:32:19,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:32:19" (1/1) ... [2023-11-29 03:32:19,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:32:19,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:32:19,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:32:19,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:32:19,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:32:19,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:32:19,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 03:32:19,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 03:32:19,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 03:32:19,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 03:32:19,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:32:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:32:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:32:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 03:32:19,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 03:32:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 03:32:19,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 03:32:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 03:32:19,844 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 03:32:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 03:32:19,844 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 03:32:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:32:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:32:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 03:32:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 03:32:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 03:32:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 03:32:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:32:19,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:32:19,847 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 03:32:20,005 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:32:20,008 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:32:20,339 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:32:20,512 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:32:20,512 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 03:32:20,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:32:20 BoogieIcfgContainer [2023-11-29 03:32:20,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:32:20,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:32:20,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:32:20,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:32:20,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:32:19" (1/3) ... [2023-11-29 03:32:20,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ec4e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:32:20, skipping insertion in model container [2023-11-29 03:32:20,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:32:19" (2/3) ... [2023-11-29 03:32:20,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ec4e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:32:20, skipping insertion in model container [2023-11-29 03:32:20,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:32:20" (3/3) ... [2023-11-29 03:32:20,520 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 03:32:20,536 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:32:20,536 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 03:32:20,536 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 03:32:20,589 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 03:32:20,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 03:32:20,651 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-29 03:32:20,651 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 03:32:20,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-11-29 03:32:20,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 03:32:20,660 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 62 transitions, 136 flow [2023-11-29 03:32:20,669 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:32:20,675 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4c07021f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:32:20,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 03:32:20,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 03:32:20,679 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 03:32:20,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 03:32:20,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:32:20,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 03:32:20,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:32:20,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:32:20,685 INFO L85 PathProgramCache]: Analyzing trace with hash 14227, now seen corresponding path program 1 times [2023-11-29 03:32:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:32:20,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934817239] [2023-11-29 03:32:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:20,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:32:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:32:20,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:32:20,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934817239] [2023-11-29 03:32:20,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934817239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:32:20,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:32:20,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:32:20,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771453681] [2023-11-29 03:32:20,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:32:20,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:32:20,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:32:20,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:32:20,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:32:20,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 03:32:20,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:20,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:32:20,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 03:32:20,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:32:22,387 INFO L124 PetriNetUnfolderBase]: 4217/7238 cut-off events. [2023-11-29 03:32:22,388 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 03:32:22,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13165 conditions, 7238 events. 4217/7238 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53851 event pairs, 3179 based on Foata normal form. 360/6962 useless extension candidates. Maximal degree in co-relation 13150. Up to 4391 conditions per place. [2023-11-29 03:32:22,472 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-29 03:32:22,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 226 flow [2023-11-29 03:32:22,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:32:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:32:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 03:32:22,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 03:32:22,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 03:32:22,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 03:32:22,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:32:22,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 03:32:22,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:22,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:22,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:22,500 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 136 flow. Second operand 3 states and 146 transitions. [2023-11-29 03:32:22,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 226 flow [2023-11-29 03:32:22,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 03:32:22,510 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 03:32:22,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-29 03:32:22,515 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-29 03:32:22,516 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 03:32:22,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:22,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:32:22,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 03:32:22,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:32:22,517 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:32:22,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:32:22,518 INFO L85 PathProgramCache]: Analyzing trace with hash 14228, now seen corresponding path program 1 times [2023-11-29 03:32:22,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:32:22,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578526749] [2023-11-29 03:32:22,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:22,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:32:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:32:22,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:32:22,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578526749] [2023-11-29 03:32:22,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578526749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:32:22,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:32:22,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:32:22,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942447274] [2023-11-29 03:32:22,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:32:22,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:32:22,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:32:22,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:32:22,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:32:22,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 03:32:22,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:22,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:32:22,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 03:32:22,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:32:23,918 INFO L124 PetriNetUnfolderBase]: 4217/7237 cut-off events. [2023-11-29 03:32:23,918 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 03:32:23,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13341 conditions, 7237 events. 4217/7237 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53803 event pairs, 3179 based on Foata normal form. 1/6602 useless extension candidates. Maximal degree in co-relation 13330. Up to 4390 conditions per place. [2023-11-29 03:32:23,983 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 35 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 03:32:23,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 222 flow [2023-11-29 03:32:23,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:32:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:32:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 03:32:23,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 03:32:23,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 03:32:23,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 03:32:23,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:32:23,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 03:32:23,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:23,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:23,990 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:23,990 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 146 transitions. [2023-11-29 03:32:23,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 222 flow [2023-11-29 03:32:24,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:32:24,003 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 03:32:24,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-29 03:32:24,004 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-29 03:32:24,004 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 03:32:24,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:24,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:32:24,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:32:24,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:32:24,006 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:32:24,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:32:24,006 INFO L85 PathProgramCache]: Analyzing trace with hash 424276393, now seen corresponding path program 1 times [2023-11-29 03:32:24,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:32:24,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756565426] [2023-11-29 03:32:24,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:24,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:32:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:32:24,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:32:24,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756565426] [2023-11-29 03:32:24,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756565426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:32:24,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:32:24,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:32:24,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296698511] [2023-11-29 03:32:24,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:32:24,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:32:24,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:32:24,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:32:24,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:32:24,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 03:32:24,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:24,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:32:24,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 03:32:24,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:32:25,011 INFO L124 PetriNetUnfolderBase]: 3311/5478 cut-off events. [2023-11-29 03:32:25,012 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-29 03:32:25,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10300 conditions, 5478 events. 3311/5478 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 39268 event pairs, 593 based on Foata normal form. 0/5401 useless extension candidates. Maximal degree in co-relation 10289. Up to 3661 conditions per place. [2023-11-29 03:32:25,047 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 41 selfloop transitions, 2 changer transitions 2/76 dead transitions. [2023-11-29 03:32:25,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 262 flow [2023-11-29 03:32:25,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:32:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:32:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2023-11-29 03:32:25,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7929292929292929 [2023-11-29 03:32:25,050 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 157 transitions. [2023-11-29 03:32:25,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 157 transitions. [2023-11-29 03:32:25,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:32:25,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 157 transitions. [2023-11-29 03:32:25,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:25,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:25,053 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:25,054 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 157 transitions. [2023-11-29 03:32:25,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 262 flow [2023-11-29 03:32:25,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:32:25,057 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 122 flow [2023-11-29 03:32:25,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-11-29 03:32:25,058 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-29 03:32:25,059 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 122 flow [2023-11-29 03:32:25,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:25,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:32:25,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:32:25,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:32:25,060 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:32:25,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:32:25,060 INFO L85 PathProgramCache]: Analyzing trace with hash 424275281, now seen corresponding path program 1 times [2023-11-29 03:32:25,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:32:25,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952572950] [2023-11-29 03:32:25,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:25,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:32:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:32:25,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:32:25,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952572950] [2023-11-29 03:32:25,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952572950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:32:25,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:32:25,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:32:25,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114168635] [2023-11-29 03:32:25,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:32:25,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:32:25,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:32:25,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:32:25,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:32:25,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 03:32:25,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:25,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:32:25,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 03:32:25,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:32:25,778 INFO L124 PetriNetUnfolderBase]: 2906/5175 cut-off events. [2023-11-29 03:32:25,778 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2023-11-29 03:32:25,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9587 conditions, 5175 events. 2906/5175 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 37785 event pairs, 1880 based on Foata normal form. 0/4927 useless extension candidates. Maximal degree in co-relation 9576. Up to 3466 conditions per place. [2023-11-29 03:32:25,816 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 03:32:25,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 212 flow [2023-11-29 03:32:25,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:32:25,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:32:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 03:32:25,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 03:32:25,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 03:32:25,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 03:32:25,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:32:25,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 03:32:25,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:25,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:25,822 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:25,822 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 141 transitions. [2023-11-29 03:32:25,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 212 flow [2023-11-29 03:32:25,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:32:25,825 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 03:32:25,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-29 03:32:25,826 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2023-11-29 03:32:25,827 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 03:32:25,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:25,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:32:25,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:32:25,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:32:25,828 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:32:25,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:32:25,829 INFO L85 PathProgramCache]: Analyzing trace with hash 424275282, now seen corresponding path program 1 times [2023-11-29 03:32:25,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:32:25,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560151611] [2023-11-29 03:32:25,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:25,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:32:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:32:25,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:32:25,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560151611] [2023-11-29 03:32:25,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560151611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:32:25,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:32:25,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:32:25,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874486836] [2023-11-29 03:32:25,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:32:25,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:32:25,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:32:25,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:32:25,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:32:25,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 03:32:25,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:25,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:32:25,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 03:32:25,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:32:26,472 INFO L124 PetriNetUnfolderBase]: 2903/5168 cut-off events. [2023-11-29 03:32:26,473 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 03:32:26,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9441 conditions, 5168 events. 2903/5168 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 37758 event pairs, 1880 based on Foata normal form. 4/4924 useless extension candidates. Maximal degree in co-relation 9431. Up to 3459 conditions per place. [2023-11-29 03:32:26,502 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 03:32:26,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 206 flow [2023-11-29 03:32:26,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:32:26,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:32:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 03:32:26,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 03:32:26,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 03:32:26,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 03:32:26,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:32:26,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 03:32:26,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:26,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:26,507 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:26,507 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 143 transitions. [2023-11-29 03:32:26,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 206 flow [2023-11-29 03:32:26,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:32:26,511 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 03:32:26,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-29 03:32:26,513 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-29 03:32:26,513 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 03:32:26,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:26,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:32:26,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:32:26,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:32:26,514 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:32:26,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:32:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash -503420956, now seen corresponding path program 1 times [2023-11-29 03:32:26,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:32:26,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689866474] [2023-11-29 03:32:26,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:26,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:32:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:32:26,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:32:26,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689866474] [2023-11-29 03:32:26,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689866474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:32:26,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:32:26,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:32:26,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539163879] [2023-11-29 03:32:26,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:32:26,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:32:26,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:32:26,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:32:26,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:32:26,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 03:32:26,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:26,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:32:26,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 03:32:26,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:32:27,140 INFO L124 PetriNetUnfolderBase]: 2920/5121 cut-off events. [2023-11-29 03:32:27,140 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 03:32:27,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9423 conditions, 5121 events. 2920/5121 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 36957 event pairs, 1892 based on Foata normal form. 0/4895 useless extension candidates. Maximal degree in co-relation 9413. Up to 3460 conditions per place. [2023-11-29 03:32:27,167 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 03:32:27,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 206 flow [2023-11-29 03:32:27,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:32:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:32:27,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 03:32:27,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 03:32:27,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 03:32:27,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 03:32:27,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:32:27,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 03:32:27,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:27,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:27,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:27,171 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 141 transitions. [2023-11-29 03:32:27,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 206 flow [2023-11-29 03:32:27,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:32:27,175 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 03:32:27,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-29 03:32:27,176 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 03:32:27,176 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 03:32:27,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:27,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:32:27,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:32:27,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:32:27,177 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:32:27,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:32:27,177 INFO L85 PathProgramCache]: Analyzing trace with hash -503420955, now seen corresponding path program 1 times [2023-11-29 03:32:27,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:32:27,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341597907] [2023-11-29 03:32:27,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:27,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:32:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:32:27,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:32:27,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341597907] [2023-11-29 03:32:27,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341597907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:32:27,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:32:27,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:32:27,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115695256] [2023-11-29 03:32:27,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:32:27,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:32:27,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:32:27,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:32:27,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:32:27,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 03:32:27,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:27,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:32:27,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 03:32:27,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:32:27,964 INFO L124 PetriNetUnfolderBase]: 2903/5092 cut-off events. [2023-11-29 03:32:27,964 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 03:32:27,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9373 conditions, 5092 events. 2903/5092 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 36910 event pairs, 1884 based on Foata normal form. 12/4886 useless extension candidates. Maximal degree in co-relation 9363. Up to 3431 conditions per place. [2023-11-29 03:32:27,996 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 03:32:27,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 202 flow [2023-11-29 03:32:27,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:32:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:32:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 03:32:27,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 03:32:27,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 03:32:27,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 03:32:27,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:32:27,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 03:32:28,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:28,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:28,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:28,001 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 143 transitions. [2023-11-29 03:32:28,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 202 flow [2023-11-29 03:32:28,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:32:28,005 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 03:32:28,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-29 03:32:28,006 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-29 03:32:28,006 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 03:32:28,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:28,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:32:28,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:32:28,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:32:28,007 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:32:28,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:32:28,008 INFO L85 PathProgramCache]: Analyzing trace with hash 612531236, now seen corresponding path program 1 times [2023-11-29 03:32:28,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:32:28,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145152357] [2023-11-29 03:32:28,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:28,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:32:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:32:28,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:32:28,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145152357] [2023-11-29 03:32:28,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145152357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:32:28,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:32:28,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:32:28,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372695876] [2023-11-29 03:32:28,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:32:28,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:32:28,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:32:28,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:32:28,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:32:28,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 03:32:28,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:28,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:32:28,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 03:32:28,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:32:28,805 INFO L124 PetriNetUnfolderBase]: 2978/5123 cut-off events. [2023-11-29 03:32:28,805 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 03:32:28,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9515 conditions, 5123 events. 2978/5123 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 36550 event pairs, 1424 based on Foata normal form. 0/4969 useless extension candidates. Maximal degree in co-relation 9505. Up to 3426 conditions per place. [2023-11-29 03:32:28,825 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 03:32:28,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 202 flow [2023-11-29 03:32:28,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:32:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:32:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 03:32:28,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 03:32:28,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 03:32:28,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 03:32:28,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:32:28,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 03:32:28,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:28,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:28,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:28,829 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 141 transitions. [2023-11-29 03:32:28,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 202 flow [2023-11-29 03:32:28,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:32:28,831 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 03:32:28,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-29 03:32:28,832 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-29 03:32:28,832 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 03:32:28,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:28,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:32:28,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:32:28,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 03:32:28,833 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:32:28,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:32:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash 612531237, now seen corresponding path program 1 times [2023-11-29 03:32:28,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:32:28,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369509442] [2023-11-29 03:32:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:32:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:32:28,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:32:28,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369509442] [2023-11-29 03:32:28,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369509442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:32:28,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:32:28,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:32:28,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600850697] [2023-11-29 03:32:28,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:32:28,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:32:28,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:32:28,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:32:28,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:32:28,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 03:32:28,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:28,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:32:28,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 03:32:28,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:32:29,547 INFO L124 PetriNetUnfolderBase]: 2903/5072 cut-off events. [2023-11-29 03:32:29,547 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 03:32:29,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9377 conditions, 5072 events. 2903/5072 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 36419 event pairs, 920 based on Foata normal form. 36/4990 useless extension candidates. Maximal degree in co-relation 9367. Up to 3315 conditions per place. [2023-11-29 03:32:29,571 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 03:32:29,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 198 flow [2023-11-29 03:32:29,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:32:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:32:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 03:32:29,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 03:32:29,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 03:32:29,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 03:32:29,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:32:29,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 03:32:29,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:29,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:29,574 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:29,574 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 143 transitions. [2023-11-29 03:32:29,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 198 flow [2023-11-29 03:32:29,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:32:29,576 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-29 03:32:29,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-11-29 03:32:29,577 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -13 predicate places. [2023-11-29 03:32:29,578 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-29 03:32:29,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:29,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:32:29,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:32:29,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 03:32:29,578 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:32:29,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:32:29,579 INFO L85 PathProgramCache]: Analyzing trace with hash -136945484, now seen corresponding path program 1 times [2023-11-29 03:32:29,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:32:29,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098689368] [2023-11-29 03:32:29,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:29,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:32:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:32:30,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:32:30,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098689368] [2023-11-29 03:32:30,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098689368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:32:30,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:32:30,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:32:30,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970181184] [2023-11-29 03:32:30,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:32:30,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:32:30,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:32:30,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:32:30,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:32:30,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-29 03:32:30,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 10 states, 10 states have (on average 34.7) internal successors, (347), 10 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:30,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:32:30,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-29 03:32:30,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:32:31,761 INFO L124 PetriNetUnfolderBase]: 3664/5602 cut-off events. [2023-11-29 03:32:31,762 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2023-11-29 03:32:31,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10972 conditions, 5602 events. 3664/5602 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 35715 event pairs, 152 based on Foata normal form. 180/5742 useless extension candidates. Maximal degree in co-relation 10962. Up to 3384 conditions per place. [2023-11-29 03:32:31,789 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 48 selfloop transitions, 5 changer transitions 13/87 dead transitions. [2023-11-29 03:32:31,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 320 flow [2023-11-29 03:32:31,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:32:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 03:32:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 331 transitions. [2023-11-29 03:32:31,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6268939393939394 [2023-11-29 03:32:31,792 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 331 transitions. [2023-11-29 03:32:31,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 331 transitions. [2023-11-29 03:32:31,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:32:31,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 331 transitions. [2023-11-29 03:32:31,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 41.375) internal successors, (331), 8 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:31,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:31,796 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:31,796 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 8 states and 331 transitions. [2023-11-29 03:32:31,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 320 flow [2023-11-29 03:32:31,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:32:31,799 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 112 flow [2023-11-29 03:32:31,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=112, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2023-11-29 03:32:31,800 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-29 03:32:31,800 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 112 flow [2023-11-29 03:32:31,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.7) internal successors, (347), 10 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:31,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:32:31,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:32:31,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 03:32:31,801 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:32:31,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:32:31,801 INFO L85 PathProgramCache]: Analyzing trace with hash -136943829, now seen corresponding path program 1 times [2023-11-29 03:32:31,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:32:31,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742716782] [2023-11-29 03:32:31,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:31,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:32:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:32:32,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:32:32,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742716782] [2023-11-29 03:32:32,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742716782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:32:32,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:32:32,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:32:32,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162185485] [2023-11-29 03:32:32,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:32:32,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:32:32,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:32:32,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:32:32,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:32:32,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2023-11-29 03:32:32,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:32,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:32:32,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2023-11-29 03:32:32,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:32:37,320 INFO L124 PetriNetUnfolderBase]: 38109/54867 cut-off events. [2023-11-29 03:32:37,320 INFO L125 PetriNetUnfolderBase]: For 2541/2541 co-relation queries the response was YES. [2023-11-29 03:32:37,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108952 conditions, 54867 events. 38109/54867 cut-off events. For 2541/2541 co-relation queries the response was YES. Maximal size of possible extension queue 2336. Compared 399132 event pairs, 8776 based on Foata normal form. 0/53587 useless extension candidates. Maximal degree in co-relation 108941. Up to 19638 conditions per place. [2023-11-29 03:32:37,554 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 47 selfloop transitions, 8 changer transitions 103/174 dead transitions. [2023-11-29 03:32:37,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 174 transitions, 704 flow [2023-11-29 03:32:37,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:32:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 03:32:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 421 transitions. [2023-11-29 03:32:37,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7087542087542088 [2023-11-29 03:32:37,557 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 421 transitions. [2023-11-29 03:32:37,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 421 transitions. [2023-11-29 03:32:37,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:32:37,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 421 transitions. [2023-11-29 03:32:37,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 46.77777777777778) internal successors, (421), 9 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:37,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:37,562 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:37,562 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 112 flow. Second operand 9 states and 421 transitions. [2023-11-29 03:32:37,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 174 transitions, 704 flow [2023-11-29 03:32:37,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 174 transitions, 684 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 03:32:37,566 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 214 flow [2023-11-29 03:32:37,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=214, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2023-11-29 03:32:37,567 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-29 03:32:37,567 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 214 flow [2023-11-29 03:32:37,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:37,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:32:37,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:32:37,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 03:32:37,568 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:32:37,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:32:37,568 INFO L85 PathProgramCache]: Analyzing trace with hash -703129142, now seen corresponding path program 1 times [2023-11-29 03:32:37,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:32:37,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466968496] [2023-11-29 03:32:37,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:37,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:32:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:32:37,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:32:37,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466968496] [2023-11-29 03:32:37,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466968496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:32:37,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:32:37,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:32:37,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193890616] [2023-11-29 03:32:37,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:32:37,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:32:37,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:32:37,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:32:37,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:32:37,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 03:32:37,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:37,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:32:37,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 03:32:37,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:32:41,656 INFO L124 PetriNetUnfolderBase]: 21191/33979 cut-off events. [2023-11-29 03:32:41,657 INFO L125 PetriNetUnfolderBase]: For 33935/36805 co-relation queries the response was YES. [2023-11-29 03:32:41,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90567 conditions, 33979 events. 21191/33979 cut-off events. For 33935/36805 co-relation queries the response was YES. Maximal size of possible extension queue 1638. Compared 282555 event pairs, 5394 based on Foata normal form. 1246/34161 useless extension candidates. Maximal degree in co-relation 90548. Up to 18528 conditions per place. [2023-11-29 03:32:41,919 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 34 selfloop transitions, 3 changer transitions 43/106 dead transitions. [2023-11-29 03:32:41,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 106 transitions, 542 flow [2023-11-29 03:32:41,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:32:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 03:32:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 314 transitions. [2023-11-29 03:32:41,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6796536796536796 [2023-11-29 03:32:41,922 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 314 transitions. [2023-11-29 03:32:41,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 314 transitions. [2023-11-29 03:32:41,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:32:41,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 314 transitions. [2023-11-29 03:32:41,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.857142857142854) internal successors, (314), 7 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:41,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:41,926 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:41,926 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 214 flow. Second operand 7 states and 314 transitions. [2023-11-29 03:32:41,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 106 transitions, 542 flow [2023-11-29 03:32:42,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 496 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-29 03:32:42,014 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 203 flow [2023-11-29 03:32:42,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2023-11-29 03:32:42,015 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-29 03:32:42,015 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 203 flow [2023-11-29 03:32:42,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:42,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:32:42,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:32:42,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 03:32:42,016 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:32:42,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:32:42,017 INFO L85 PathProgramCache]: Analyzing trace with hash 330041774, now seen corresponding path program 1 times [2023-11-29 03:32:42,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:32:42,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323140744] [2023-11-29 03:32:42,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:42,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:32:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:32:42,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:32:42,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323140744] [2023-11-29 03:32:42,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323140744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:32:42,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:32:42,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:32:42,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496989030] [2023-11-29 03:32:42,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:32:42,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:32:42,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:32:42,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:32:42,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:32:42,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-29 03:32:42,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:42,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:32:42,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-29 03:32:42,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:32:44,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_71 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_35 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_57 256) 0)) .cse3))) (and (= v_~a$w_buff0_used~0_71 (ite .cse0 0 v_~a$w_buff0_used~0_72)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_57) v_~a$w_buff1_used~0_56) (= v_~a$r_buff0_thd1~0_34 (ite .cse1 0 v_~a$r_buff0_thd1~0_35)) (= v_~a~0_22 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse2 v_~a$w_buff1~0_15 v_~a~0_23))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_56 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_34 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19)))) InVars {~a~0=v_~a~0_23, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_72, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_35, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57} OutVars{~a~0=v_~a~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_71, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_56} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][35], [30#L876true, Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 63#L791true, P1Thread1of1ForFork1InUse, 53#L771true, P2Thread1of1ForFork0InUse, 62#L824true, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 35#L811true, 168#true]) [2023-11-29 03:32:44,187 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-29 03:32:44,188 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 03:32:44,188 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 03:32:44,188 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 03:32:44,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][62], [30#L876true, Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 29#L764true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 63#L791true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 35#L811true, 46#L840true, 168#true]) [2023-11-29 03:32:44,188 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-29 03:32:44,188 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 03:32:44,188 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 03:32:44,188 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 03:32:44,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_71 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_35 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_57 256) 0)) .cse3))) (and (= v_~a$w_buff0_used~0_71 (ite .cse0 0 v_~a$w_buff0_used~0_72)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_57) v_~a$w_buff1_used~0_56) (= v_~a$r_buff0_thd1~0_34 (ite .cse1 0 v_~a$r_buff0_thd1~0_35)) (= v_~a~0_22 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse2 v_~a$w_buff1~0_15 v_~a~0_23))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_56 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_34 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19)))) InVars {~a~0=v_~a~0_23, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_72, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_35, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57} OutVars{~a~0=v_~a~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_71, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_56} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][35], [Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 44#L882true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 63#L791true, P1Thread1of1ForFork1InUse, 62#L824true, 53#L771true, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 35#L811true, 168#true]) [2023-11-29 03:32:44,454 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-29 03:32:44,454 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 03:32:44,454 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 03:32:44,454 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 03:32:44,455 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][62], [Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 44#L882true, 29#L764true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 63#L791true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 131#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 35#L811true, 46#L840true, 168#true]) [2023-11-29 03:32:44,455 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-29 03:32:44,455 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 03:32:44,455 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 03:32:44,455 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 03:32:44,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_71 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_35 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_57 256) 0)) .cse3))) (and (= v_~a$w_buff0_used~0_71 (ite .cse0 0 v_~a$w_buff0_used~0_72)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_57) v_~a$w_buff1_used~0_56) (= v_~a$r_buff0_thd1~0_34 (ite .cse1 0 v_~a$r_buff0_thd1~0_35)) (= v_~a~0_22 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse2 v_~a$w_buff1~0_15 v_~a~0_23))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_56 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_34 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19)))) InVars {~a~0=v_~a~0_23, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_72, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_35, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57} OutVars{~a~0=v_~a~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_71, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_56} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][35], [30#L876true, Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork1InUse, 53#L771true, P2Thread1of1ForFork0InUse, 62#L824true, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 35#L811true, 31#P1EXITtrue, 168#true]) [2023-11-29 03:32:44,760 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 03:32:44,760 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 03:32:44,760 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 03:32:44,760 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 03:32:44,760 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][62], [30#L876true, Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 29#L764true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 35#L811true, 31#P1EXITtrue, 46#L840true, 168#true]) [2023-11-29 03:32:44,760 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 03:32:44,760 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 03:32:44,760 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 03:32:44,761 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 03:32:44,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_71 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_35 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_57 256) 0)) .cse3))) (and (= v_~a$w_buff0_used~0_71 (ite .cse0 0 v_~a$w_buff0_used~0_72)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_57) v_~a$w_buff1_used~0_56) (= v_~a$r_buff0_thd1~0_34 (ite .cse1 0 v_~a$r_buff0_thd1~0_35)) (= v_~a~0_22 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse2 v_~a$w_buff1~0_15 v_~a~0_23))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_56 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_34 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19)))) InVars {~a~0=v_~a~0_23, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_72, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_35, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57} OutVars{~a~0=v_~a~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_71, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_56} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][35], [30#L876true, Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 63#L791true, P1Thread1of1ForFork1InUse, 53#L771true, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 62#L824true, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 168#true]) [2023-11-29 03:32:44,762 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 03:32:44,762 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 03:32:44,762 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 03:32:44,762 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 03:32:44,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][62], [30#L876true, Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 29#L764true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 63#L791true, P1Thread1of1ForFork1InUse, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 46#L840true, 168#true]) [2023-11-29 03:32:44,762 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 03:32:44,762 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 03:32:44,762 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 03:32:44,762 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 03:32:45,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_71 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_35 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_57 256) 0)) .cse3))) (and (= v_~a$w_buff0_used~0_71 (ite .cse0 0 v_~a$w_buff0_used~0_72)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_57) v_~a$w_buff1_used~0_56) (= v_~a$r_buff0_thd1~0_34 (ite .cse1 0 v_~a$r_buff0_thd1~0_35)) (= v_~a~0_22 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse2 v_~a$w_buff1~0_15 v_~a~0_23))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_56 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_34 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19)))) InVars {~a~0=v_~a~0_23, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_72, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_35, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57} OutVars{~a~0=v_~a~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_71, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_56} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][35], [Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 44#L882true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork1InUse, 62#L824true, 53#L771true, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 35#L811true, 31#P1EXITtrue, 168#true]) [2023-11-29 03:32:45,230 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 03:32:45,230 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 03:32:45,230 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 03:32:45,230 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 03:32:45,230 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][62], [Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 44#L882true, 29#L764true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 131#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 35#L811true, 31#P1EXITtrue, 46#L840true, 168#true]) [2023-11-29 03:32:45,230 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 03:32:45,230 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 03:32:45,231 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 03:32:45,231 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 03:32:45,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_71 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_35 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_57 256) 0)) .cse3))) (and (= v_~a$w_buff0_used~0_71 (ite .cse0 0 v_~a$w_buff0_used~0_72)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_57) v_~a$w_buff1_used~0_56) (= v_~a$r_buff0_thd1~0_34 (ite .cse1 0 v_~a$r_buff0_thd1~0_35)) (= v_~a~0_22 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse2 v_~a$w_buff1~0_15 v_~a~0_23))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_56 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_34 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19)))) InVars {~a~0=v_~a~0_23, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_72, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_35, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57} OutVars{~a~0=v_~a~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_71, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_56} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][35], [Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 44#L882true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 63#L791true, P1Thread1of1ForFork1InUse, 53#L771true, 62#L824true, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 168#true]) [2023-11-29 03:32:45,232 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 03:32:45,232 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 03:32:45,232 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 03:32:45,232 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 03:32:45,233 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][62], [Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 44#L882true, 29#L764true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 63#L791true, P1Thread1of1ForFork1InUse, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 46#L840true, 168#true]) [2023-11-29 03:32:45,233 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 03:32:45,233 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 03:32:45,233 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 03:32:45,233 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 03:32:45,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_71 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_35 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_57 256) 0)) .cse3))) (and (= v_~a$w_buff0_used~0_71 (ite .cse0 0 v_~a$w_buff0_used~0_72)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_57) v_~a$w_buff1_used~0_56) (= v_~a$r_buff0_thd1~0_34 (ite .cse1 0 v_~a$r_buff0_thd1~0_35)) (= v_~a~0_22 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse2 v_~a$w_buff1~0_15 v_~a~0_23))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_56 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_34 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19)))) InVars {~a~0=v_~a~0_23, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_72, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_35, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57} OutVars{~a~0=v_~a~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_71, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_56} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][35], [30#L876true, Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork1InUse, 66#P2EXITtrue, 53#L771true, P2Thread1of1ForFork0InUse, 62#L824true, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 31#P1EXITtrue, 168#true]) [2023-11-29 03:32:45,477 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 03:32:45,477 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 03:32:45,477 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 03:32:45,478 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 03:32:45,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][62], [30#L876true, Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 29#L764true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork1InUse, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 131#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 31#P1EXITtrue, 46#L840true, 168#true]) [2023-11-29 03:32:45,478 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 03:32:45,478 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 03:32:45,478 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 03:32:45,478 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 03:32:45,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_71 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_35 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_57 256) 0)) .cse3))) (and (= v_~a$w_buff0_used~0_71 (ite .cse0 0 v_~a$w_buff0_used~0_72)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_57) v_~a$w_buff1_used~0_56) (= v_~a$r_buff0_thd1~0_34 (ite .cse1 0 v_~a$r_buff0_thd1~0_35)) (= v_~a~0_22 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse2 v_~a$w_buff1~0_15 v_~a~0_23))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_56 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_34 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19)))) InVars {~a~0=v_~a~0_23, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_72, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_35, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57} OutVars{~a~0=v_~a~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_71, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_56} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][35], [Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 44#L882true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork1InUse, 62#L824true, 53#L771true, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 31#P1EXITtrue, 168#true]) [2023-11-29 03:32:45,689 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 03:32:45,689 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 03:32:45,689 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 03:32:45,689 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 03:32:45,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][62], [Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 44#L882true, 29#L764true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork1InUse, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 131#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 31#P1EXITtrue, 168#true, 46#L840true]) [2023-11-29 03:32:45,689 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 03:32:45,689 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 03:32:45,690 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 03:32:45,690 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 03:32:46,193 INFO L124 PetriNetUnfolderBase]: 21368/33788 cut-off events. [2023-11-29 03:32:46,194 INFO L125 PetriNetUnfolderBase]: For 46474/47081 co-relation queries the response was YES. [2023-11-29 03:32:46,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90608 conditions, 33788 events. 21368/33788 cut-off events. For 46474/47081 co-relation queries the response was YES. Maximal size of possible extension queue 1573. Compared 275026 event pairs, 6010 based on Foata normal form. 1059/34053 useless extension candidates. Maximal degree in co-relation 90586. Up to 21541 conditions per place. [2023-11-29 03:32:46,419 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 42 selfloop transitions, 5 changer transitions 55/126 dead transitions. [2023-11-29 03:32:46,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 126 transitions, 697 flow [2023-11-29 03:32:46,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:32:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 03:32:46,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 317 transitions. [2023-11-29 03:32:46,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6861471861471862 [2023-11-29 03:32:46,422 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 317 transitions. [2023-11-29 03:32:46,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 317 transitions. [2023-11-29 03:32:46,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:32:46,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 317 transitions. [2023-11-29 03:32:46,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:46,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:46,425 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:46,425 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 203 flow. Second operand 7 states and 317 transitions. [2023-11-29 03:32:46,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 126 transitions, 697 flow [2023-11-29 03:32:46,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 126 transitions, 675 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-29 03:32:46,896 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 262 flow [2023-11-29 03:32:46,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2023-11-29 03:32:46,896 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 1 predicate places. [2023-11-29 03:32:46,896 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 262 flow [2023-11-29 03:32:46,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:46,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:32:46,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:32:46,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 03:32:46,897 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:32:46,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:32:46,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1669374097, now seen corresponding path program 1 times [2023-11-29 03:32:46,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:32:46,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428488517] [2023-11-29 03:32:46,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:46,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:32:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:32:47,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:32:47,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428488517] [2023-11-29 03:32:47,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428488517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:32:47,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:32:47,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:32:47,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048597173] [2023-11-29 03:32:47,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:32:47,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:32:47,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:32:47,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:32:47,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:32:47,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2023-11-29 03:32:47,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:47,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:32:47,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2023-11-29 03:32:47,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:32:51,840 INFO L124 PetriNetUnfolderBase]: 24537/35948 cut-off events. [2023-11-29 03:32:51,841 INFO L125 PetriNetUnfolderBase]: For 67513/67591 co-relation queries the response was YES. [2023-11-29 03:32:51,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109286 conditions, 35948 events. 24537/35948 cut-off events. For 67513/67591 co-relation queries the response was YES. Maximal size of possible extension queue 1402. Compared 252408 event pairs, 5195 based on Foata normal form. 725/36630 useless extension candidates. Maximal degree in co-relation 109263. Up to 16062 conditions per place. [2023-11-29 03:32:52,046 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 69 selfloop transitions, 14 changer transitions 78/177 dead transitions. [2023-11-29 03:32:52,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 177 transitions, 1078 flow [2023-11-29 03:32:52,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:32:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 03:32:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 446 transitions. [2023-11-29 03:32:52,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6757575757575758 [2023-11-29 03:32:52,049 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 446 transitions. [2023-11-29 03:32:52,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 446 transitions. [2023-11-29 03:32:52,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:32:52,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 446 transitions. [2023-11-29 03:32:52,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 44.6) internal successors, (446), 10 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:52,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:52,052 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:52,053 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 262 flow. Second operand 10 states and 446 transitions. [2023-11-29 03:32:52,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 177 transitions, 1078 flow [2023-11-29 03:32:52,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 177 transitions, 1057 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-29 03:32:52,231 INFO L231 Difference]: Finished difference. Result has 84 places, 63 transitions, 359 flow [2023-11-29 03:32:52,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=359, PETRI_PLACES=84, PETRI_TRANSITIONS=63} [2023-11-29 03:32:52,232 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 11 predicate places. [2023-11-29 03:32:52,232 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 359 flow [2023-11-29 03:32:52,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:52,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:32:52,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:32:52,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 03:32:52,232 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:32:52,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:32:52,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1387293187, now seen corresponding path program 1 times [2023-11-29 03:32:52,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:32:52,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079618311] [2023-11-29 03:32:52,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:52,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:32:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:32:52,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:32:52,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079618311] [2023-11-29 03:32:52,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079618311] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:32:52,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:32:52,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:32:52,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802749895] [2023-11-29 03:32:52,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:32:52,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:32:52,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:32:52,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:32:52,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:32:52,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2023-11-29 03:32:52,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 63 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:52,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:32:52,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2023-11-29 03:32:52,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:32:59,157 INFO L124 PetriNetUnfolderBase]: 32685/48382 cut-off events. [2023-11-29 03:32:59,158 INFO L125 PetriNetUnfolderBase]: For 138869/138935 co-relation queries the response was YES. [2023-11-29 03:32:59,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156648 conditions, 48382 events. 32685/48382 cut-off events. For 138869/138935 co-relation queries the response was YES. Maximal size of possible extension queue 1910. Compared 365973 event pairs, 5755 based on Foata normal form. 880/49179 useless extension candidates. Maximal degree in co-relation 156618. Up to 17546 conditions per place. [2023-11-29 03:32:59,444 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 72 selfloop transitions, 17 changer transitions 81/186 dead transitions. [2023-11-29 03:32:59,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 186 transitions, 1241 flow [2023-11-29 03:32:59,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:32:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 03:32:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 445 transitions. [2023-11-29 03:32:59,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6742424242424242 [2023-11-29 03:32:59,447 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 445 transitions. [2023-11-29 03:32:59,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 445 transitions. [2023-11-29 03:32:59,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:32:59,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 445 transitions. [2023-11-29 03:32:59,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 44.5) internal successors, (445), 10 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:59,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:59,451 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:32:59,452 INFO L175 Difference]: Start difference. First operand has 84 places, 63 transitions, 359 flow. Second operand 10 states and 445 transitions. [2023-11-29 03:32:59,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 186 transitions, 1241 flow [2023-11-29 03:33:00,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 186 transitions, 1167 flow, removed 37 selfloop flow, removed 6 redundant places. [2023-11-29 03:33:00,823 INFO L231 Difference]: Finished difference. Result has 90 places, 67 transitions, 467 flow [2023-11-29 03:33:00,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=467, PETRI_PLACES=90, PETRI_TRANSITIONS=67} [2023-11-29 03:33:00,824 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 17 predicate places. [2023-11-29 03:33:00,824 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 67 transitions, 467 flow [2023-11-29 03:33:00,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:00,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:33:00,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:33:00,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 03:33:00,824 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:33:00,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:33:00,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1606668272, now seen corresponding path program 1 times [2023-11-29 03:33:00,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:33:00,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958101792] [2023-11-29 03:33:00,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:33:00,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:33:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:33:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:33:00,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:33:00,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958101792] [2023-11-29 03:33:00,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958101792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:33:00,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:33:00,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:33:00,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343512284] [2023-11-29 03:33:00,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:33:00,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:33:00,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:33:00,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:33:00,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:33:00,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 03:33:00,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 67 transitions, 467 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:00,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:33:00,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 03:33:00,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:33:10,369 INFO L124 PetriNetUnfolderBase]: 55029/81707 cut-off events. [2023-11-29 03:33:10,369 INFO L125 PetriNetUnfolderBase]: For 135742/141274 co-relation queries the response was YES. [2023-11-29 03:33:10,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215342 conditions, 81707 events. 55029/81707 cut-off events. For 135742/141274 co-relation queries the response was YES. Maximal size of possible extension queue 2819. Compared 634648 event pairs, 10425 based on Foata normal form. 3940/83739 useless extension candidates. Maximal degree in co-relation 215307. Up to 44810 conditions per place. [2023-11-29 03:33:10,913 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 60 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2023-11-29 03:33:10,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 103 transitions, 729 flow [2023-11-29 03:33:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:33:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 03:33:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2023-11-29 03:33:10,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7196969696969697 [2023-11-29 03:33:10,915 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 190 transitions. [2023-11-29 03:33:10,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 190 transitions. [2023-11-29 03:33:10,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:33:10,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 190 transitions. [2023-11-29 03:33:10,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:10,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:10,917 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:10,917 INFO L175 Difference]: Start difference. First operand has 90 places, 67 transitions, 467 flow. Second operand 4 states and 190 transitions. [2023-11-29 03:33:10,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 103 transitions, 729 flow [2023-11-29 03:33:11,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 103 transitions, 713 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-29 03:33:11,296 INFO L231 Difference]: Finished difference. Result has 87 places, 72 transitions, 497 flow [2023-11-29 03:33:11,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=497, PETRI_PLACES=87, PETRI_TRANSITIONS=72} [2023-11-29 03:33:11,297 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 14 predicate places. [2023-11-29 03:33:11,297 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 72 transitions, 497 flow [2023-11-29 03:33:11,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:11,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:33:11,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:33:11,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 03:33:11,298 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:33:11,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:33:11,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1273563900, now seen corresponding path program 1 times [2023-11-29 03:33:11,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:33:11,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852426427] [2023-11-29 03:33:11,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:33:11,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:33:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:33:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:33:11,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:33:11,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852426427] [2023-11-29 03:33:11,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852426427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:33:11,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:33:11,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:33:11,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500720659] [2023-11-29 03:33:11,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:33:11,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:33:11,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:33:11,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:33:11,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:33:11,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-29 03:33:11,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 72 transitions, 497 flow. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:11,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:33:11,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-29 03:33:11,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:33:19,413 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L784-->L791: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd2~0_28 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_30 256) 0)))) (let ((.cse1 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_84 256) 0)))) (.cse0 (and .cse4 .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_71 256) 0)) .cse3))) (and (= v_~a$r_buff0_thd2~0_29 (ite .cse0 0 v_~a$r_buff0_thd2~0_30)) (= v_~a~0_26 (ite .cse1 v_~a$w_buff0~0_24 (ite .cse2 v_~a$w_buff1~0_17 v_~a~0_27))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_70 256) 0))) (and .cse4 (not (= (mod v_~a$r_buff0_thd2~0_29 256) 0)))) 0 v_~a$r_buff1_thd2~0_28) v_~a$r_buff1_thd2~0_27) (= (ite .cse1 0 v_~a$w_buff0_used~0_84) v_~a$w_buff0_used~0_83) (= (ite (or .cse0 .cse2) 0 v_~a$w_buff1_used~0_71) v_~a$w_buff1_used~0_70)))) InVars {~a~0=v_~a~0_27, ~a$w_buff1~0=v_~a$w_buff1~0_17, ~a$w_buff0~0=v_~a$w_buff0~0_24, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_28, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_30, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_84, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_71} OutVars{~a~0=v_~a~0_26, ~a$w_buff1~0=v_~a$w_buff1~0_17, ~a$w_buff0~0=v_~a$w_buff0~0_24, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_27, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_29, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_83, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_70} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][39], [30#L876true, 247#(= ~x~0 1), P1Thread1of1ForFork1InUse, 63#L791true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(= ~x~0 0), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 236#true, 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 8#L804true, Black: 214#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 225#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 221#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 210#true, Black: 213#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 223#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 43#P0EXITtrue, Black: 241#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 239#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 170#(= ~y~0 0), Black: 176#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 174#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0)), 12#P3EXITtrue, 212#(= ~y~0 1)]) [2023-11-29 03:33:19,413 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 03:33:19,413 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 03:33:19,413 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 03:33:19,413 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 03:33:20,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L784-->L791: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd2~0_28 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_30 256) 0)))) (let ((.cse1 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_84 256) 0)))) (.cse0 (and .cse4 .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_71 256) 0)) .cse3))) (and (= v_~a$r_buff0_thd2~0_29 (ite .cse0 0 v_~a$r_buff0_thd2~0_30)) (= v_~a~0_26 (ite .cse1 v_~a$w_buff0~0_24 (ite .cse2 v_~a$w_buff1~0_17 v_~a~0_27))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_70 256) 0))) (and .cse4 (not (= (mod v_~a$r_buff0_thd2~0_29 256) 0)))) 0 v_~a$r_buff1_thd2~0_28) v_~a$r_buff1_thd2~0_27) (= (ite .cse1 0 v_~a$w_buff0_used~0_84) v_~a$w_buff0_used~0_83) (= (ite (or .cse0 .cse2) 0 v_~a$w_buff1_used~0_71) v_~a$w_buff1_used~0_70)))) InVars {~a~0=v_~a~0_27, ~a$w_buff1~0=v_~a$w_buff1~0_17, ~a$w_buff0~0=v_~a$w_buff0~0_24, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_28, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_30, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_84, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_71} OutVars{~a~0=v_~a~0_26, ~a$w_buff1~0=v_~a$w_buff1~0_17, ~a$w_buff0~0=v_~a$w_buff0~0_24, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_27, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_29, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_83, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_70} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][39], [247#(= ~x~0 1), 44#L882true, P1Thread1of1ForFork1InUse, 63#L791true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(= ~x~0 0), Black: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 236#true, 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 8#L804true, Black: 214#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 225#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 221#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 210#true, Black: 213#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 223#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 43#P0EXITtrue, Black: 241#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 239#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 170#(= ~y~0 0), Black: 176#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 174#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0)), 12#P3EXITtrue, 212#(= ~y~0 1)]) [2023-11-29 03:33:20,347 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 03:33:20,347 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 03:33:20,347 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 03:33:20,347 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 03:33:23,259 INFO L124 PetriNetUnfolderBase]: 55317/86936 cut-off events. [2023-11-29 03:33:23,259 INFO L125 PetriNetUnfolderBase]: For 197283/202585 co-relation queries the response was YES. [2023-11-29 03:33:23,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256781 conditions, 86936 events. 55317/86936 cut-off events. For 197283/202585 co-relation queries the response was YES. Maximal size of possible extension queue 4140. Compared 793258 event pairs, 25986 based on Foata normal form. 2344/81872 useless extension candidates. Maximal degree in co-relation 256744. Up to 32378 conditions per place. [2023-11-29 03:33:23,886 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 87 selfloop transitions, 12 changer transitions 2/138 dead transitions. [2023-11-29 03:33:23,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 138 transitions, 992 flow [2023-11-29 03:33:23,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:33:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 03:33:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 321 transitions. [2023-11-29 03:33:23,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6948051948051948 [2023-11-29 03:33:23,888 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 321 transitions. [2023-11-29 03:33:23,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 321 transitions. [2023-11-29 03:33:23,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:33:23,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 321 transitions. [2023-11-29 03:33:23,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.857142857142854) internal successors, (321), 7 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:23,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:23,891 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:23,891 INFO L175 Difference]: Start difference. First operand has 87 places, 72 transitions, 497 flow. Second operand 7 states and 321 transitions. [2023-11-29 03:33:23,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 138 transitions, 992 flow [2023-11-29 03:33:24,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 138 transitions, 990 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 03:33:24,281 INFO L231 Difference]: Finished difference. Result has 97 places, 77 transitions, 602 flow [2023-11-29 03:33:24,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=602, PETRI_PLACES=97, PETRI_TRANSITIONS=77} [2023-11-29 03:33:24,281 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 24 predicate places. [2023-11-29 03:33:24,282 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 77 transitions, 602 flow [2023-11-29 03:33:24,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:24,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:33:24,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:33:24,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 03:33:24,282 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:33:24,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:33:24,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1909000941, now seen corresponding path program 1 times [2023-11-29 03:33:24,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:33:24,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515109598] [2023-11-29 03:33:24,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:33:24,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:33:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:33:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:33:24,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:33:24,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515109598] [2023-11-29 03:33:24,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515109598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:33:24,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:33:24,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:33:24,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588476396] [2023-11-29 03:33:24,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:33:24,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:33:24,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:33:24,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:33:24,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:33:24,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 03:33:24,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 77 transitions, 602 flow. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:24,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:33:24,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 03:33:24,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:33:36,605 INFO L124 PetriNetUnfolderBase]: 67506/99485 cut-off events. [2023-11-29 03:33:36,606 INFO L125 PetriNetUnfolderBase]: For 167311/172483 co-relation queries the response was YES. [2023-11-29 03:33:37,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283063 conditions, 99485 events. 67506/99485 cut-off events. For 167311/172483 co-relation queries the response was YES. Maximal size of possible extension queue 3587. Compared 776573 event pairs, 8990 based on Foata normal form. 4765/101504 useless extension candidates. Maximal degree in co-relation 283021. Up to 37329 conditions per place. [2023-11-29 03:33:37,226 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 78 selfloop transitions, 10 changer transitions 3/130 dead transitions. [2023-11-29 03:33:37,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 130 transitions, 994 flow [2023-11-29 03:33:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:33:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 03:33:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2023-11-29 03:33:37,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 03:33:37,228 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 242 transitions. [2023-11-29 03:33:37,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 242 transitions. [2023-11-29 03:33:37,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:33:37,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 242 transitions. [2023-11-29 03:33:37,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:37,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:37,230 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:37,230 INFO L175 Difference]: Start difference. First operand has 97 places, 77 transitions, 602 flow. Second operand 5 states and 242 transitions. [2023-11-29 03:33:37,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 130 transitions, 994 flow [2023-11-29 03:33:39,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 130 transitions, 967 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-11-29 03:33:39,200 INFO L231 Difference]: Finished difference. Result has 102 places, 79 transitions, 606 flow [2023-11-29 03:33:39,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=606, PETRI_PLACES=102, PETRI_TRANSITIONS=79} [2023-11-29 03:33:39,201 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 29 predicate places. [2023-11-29 03:33:39,201 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 79 transitions, 606 flow [2023-11-29 03:33:39,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:39,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:33:39,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:33:39,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 03:33:39,201 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:33:39,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:33:39,202 INFO L85 PathProgramCache]: Analyzing trace with hash 456260776, now seen corresponding path program 1 times [2023-11-29 03:33:39,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:33:39,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270160819] [2023-11-29 03:33:39,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:33:39,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:33:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:33:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:33:39,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:33:39,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270160819] [2023-11-29 03:33:39,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270160819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:33:39,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:33:39,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:33:39,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586158145] [2023-11-29 03:33:39,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:33:39,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:33:39,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:33:39,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:33:39,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:33:39,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 03:33:39,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 79 transitions, 606 flow. Second operand has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:39,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:33:39,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 03:33:39,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:33:49,124 INFO L124 PetriNetUnfolderBase]: 52006/76313 cut-off events. [2023-11-29 03:33:49,124 INFO L125 PetriNetUnfolderBase]: For 127457/131196 co-relation queries the response was YES. [2023-11-29 03:33:49,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234876 conditions, 76313 events. 52006/76313 cut-off events. For 127457/131196 co-relation queries the response was YES. Maximal size of possible extension queue 3123. Compared 581236 event pairs, 5480 based on Foata normal form. 2925/76710 useless extension candidates. Maximal degree in co-relation 234831. Up to 26498 conditions per place. [2023-11-29 03:33:49,592 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 90 selfloop transitions, 14 changer transitions 4/147 dead transitions. [2023-11-29 03:33:49,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 147 transitions, 1111 flow [2023-11-29 03:33:49,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:33:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 03:33:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 292 transitions. [2023-11-29 03:33:49,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 03:33:49,594 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 292 transitions. [2023-11-29 03:33:49,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 292 transitions. [2023-11-29 03:33:49,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:33:49,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 292 transitions. [2023-11-29 03:33:49,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:49,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:49,596 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:49,597 INFO L175 Difference]: Start difference. First operand has 102 places, 79 transitions, 606 flow. Second operand 6 states and 292 transitions. [2023-11-29 03:33:49,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 147 transitions, 1111 flow [2023-11-29 03:33:49,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 147 transitions, 1079 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-11-29 03:33:49,841 INFO L231 Difference]: Finished difference. Result has 101 places, 84 transitions, 660 flow [2023-11-29 03:33:49,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=660, PETRI_PLACES=101, PETRI_TRANSITIONS=84} [2023-11-29 03:33:49,841 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 28 predicate places. [2023-11-29 03:33:49,842 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 84 transitions, 660 flow [2023-11-29 03:33:49,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:49,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:33:49,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:33:49,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 03:33:49,842 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:33:49,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:33:49,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1132715108, now seen corresponding path program 1 times [2023-11-29 03:33:49,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:33:49,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155449313] [2023-11-29 03:33:49,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:33:49,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:33:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:33:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:33:50,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:33:50,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155449313] [2023-11-29 03:33:50,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155449313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:33:50,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:33:50,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:33:50,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126933177] [2023-11-29 03:33:50,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:33:50,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:33:50,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:33:50,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:33:50,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:33:50,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 03:33:50,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 84 transitions, 660 flow. Second operand has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:50,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:33:50,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 03:33:50,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:33:58,918 INFO L124 PetriNetUnfolderBase]: 47934/69969 cut-off events. [2023-11-29 03:33:58,918 INFO L125 PetriNetUnfolderBase]: For 165657/169236 co-relation queries the response was YES. [2023-11-29 03:33:59,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230038 conditions, 69969 events. 47934/69969 cut-off events. For 165657/169236 co-relation queries the response was YES. Maximal size of possible extension queue 3116. Compared 530682 event pairs, 5392 based on Foata normal form. 1321/68770 useless extension candidates. Maximal degree in co-relation 229995. Up to 26498 conditions per place. [2023-11-29 03:33:59,303 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 79 selfloop transitions, 18 changer transitions 11/140 dead transitions. [2023-11-29 03:33:59,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 140 transitions, 1063 flow [2023-11-29 03:33:59,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:33:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 03:33:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 320 transitions. [2023-11-29 03:33:59,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6926406926406926 [2023-11-29 03:33:59,305 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 320 transitions. [2023-11-29 03:33:59,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 320 transitions. [2023-11-29 03:33:59,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:33:59,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 320 transitions. [2023-11-29 03:33:59,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.714285714285715) internal successors, (320), 7 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:59,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:59,307 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:33:59,307 INFO L175 Difference]: Start difference. First operand has 101 places, 84 transitions, 660 flow. Second operand 7 states and 320 transitions. [2023-11-29 03:33:59,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 140 transitions, 1063 flow [2023-11-29 03:34:05,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 140 transitions, 970 flow, removed 36 selfloop flow, removed 11 redundant places. [2023-11-29 03:34:05,092 INFO L231 Difference]: Finished difference. Result has 97 places, 78 transitions, 569 flow [2023-11-29 03:34:05,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=569, PETRI_PLACES=97, PETRI_TRANSITIONS=78} [2023-11-29 03:34:05,093 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 24 predicate places. [2023-11-29 03:34:05,093 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 78 transitions, 569 flow [2023-11-29 03:34:05,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:05,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:05,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:34:05,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 03:34:05,094 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:05,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:05,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1598040899, now seen corresponding path program 1 times [2023-11-29 03:34:05,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:34:05,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987264446] [2023-11-29 03:34:05,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:05,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:34:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:34:06,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:34:06,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987264446] [2023-11-29 03:34:06,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987264446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:34:06,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:34:06,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:34:06,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809882418] [2023-11-29 03:34:06,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:34:06,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:34:06,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:34:06,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:34:06,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:34:06,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2023-11-29 03:34:06,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 78 transitions, 569 flow. Second operand has 10 states, 10 states have (on average 31.6) internal successors, (316), 10 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:06,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:34:06,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2023-11-29 03:34:06,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:34:10,373 INFO L124 PetriNetUnfolderBase]: 18787/30574 cut-off events. [2023-11-29 03:34:10,374 INFO L125 PetriNetUnfolderBase]: For 88992/96689 co-relation queries the response was YES. [2023-11-29 03:34:10,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101410 conditions, 30574 events. 18787/30574 cut-off events. For 88992/96689 co-relation queries the response was YES. Maximal size of possible extension queue 1983. Compared 257120 event pairs, 3247 based on Foata normal form. 474/28410 useless extension candidates. Maximal degree in co-relation 101373. Up to 7775 conditions per place. [2023-11-29 03:34:10,555 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 100 selfloop transitions, 37 changer transitions 23/192 dead transitions. [2023-11-29 03:34:10,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 192 transitions, 1494 flow [2023-11-29 03:34:10,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:34:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 03:34:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 426 transitions. [2023-11-29 03:34:10,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6454545454545455 [2023-11-29 03:34:10,557 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 426 transitions. [2023-11-29 03:34:10,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 426 transitions. [2023-11-29 03:34:10,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:34:10,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 426 transitions. [2023-11-29 03:34:10,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 42.6) internal successors, (426), 10 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:10,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:10,560 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:10,560 INFO L175 Difference]: Start difference. First operand has 97 places, 78 transitions, 569 flow. Second operand 10 states and 426 transitions. [2023-11-29 03:34:10,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 192 transitions, 1494 flow [2023-11-29 03:34:11,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 192 transitions, 1265 flow, removed 62 selfloop flow, removed 11 redundant places. [2023-11-29 03:34:11,462 INFO L231 Difference]: Finished difference. Result has 100 places, 99 transitions, 772 flow [2023-11-29 03:34:11,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=772, PETRI_PLACES=100, PETRI_TRANSITIONS=99} [2023-11-29 03:34:11,463 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 27 predicate places. [2023-11-29 03:34:11,463 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 99 transitions, 772 flow [2023-11-29 03:34:11,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 31.6) internal successors, (316), 10 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:11,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:11,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:34:11,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 03:34:11,464 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:11,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:11,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2104986385, now seen corresponding path program 2 times [2023-11-29 03:34:11,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:34:11,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273977595] [2023-11-29 03:34:11,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:11,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:34:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:34:11,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:34:11,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273977595] [2023-11-29 03:34:11,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273977595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:34:11,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:34:11,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:34:11,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886449237] [2023-11-29 03:34:11,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:34:11,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:34:11,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:34:11,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:34:11,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:34:11,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-29 03:34:11,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 99 transitions, 772 flow. Second operand has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:11,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:34:11,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-29 03:34:11,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:34:16,878 INFO L124 PetriNetUnfolderBase]: 24186/42955 cut-off events. [2023-11-29 03:34:16,878 INFO L125 PetriNetUnfolderBase]: For 81114/91671 co-relation queries the response was YES. [2023-11-29 03:34:17,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124039 conditions, 42955 events. 24186/42955 cut-off events. For 81114/91671 co-relation queries the response was YES. Maximal size of possible extension queue 3408. Compared 427064 event pairs, 5274 based on Foata normal form. 910/39569 useless extension candidates. Maximal degree in co-relation 124003. Up to 15114 conditions per place. [2023-11-29 03:34:17,113 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 31 selfloop transitions, 1 changer transitions 74/142 dead transitions. [2023-11-29 03:34:17,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 142 transitions, 1142 flow [2023-11-29 03:34:17,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:34:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 03:34:17,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 257 transitions. [2023-11-29 03:34:17,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.648989898989899 [2023-11-29 03:34:17,115 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 257 transitions. [2023-11-29 03:34:17,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 257 transitions. [2023-11-29 03:34:17,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:34:17,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 257 transitions. [2023-11-29 03:34:17,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:17,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:17,117 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:17,117 INFO L175 Difference]: Start difference. First operand has 100 places, 99 transitions, 772 flow. Second operand 6 states and 257 transitions. [2023-11-29 03:34:17,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 142 transitions, 1142 flow [2023-11-29 03:34:19,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 142 transitions, 1127 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-29 03:34:19,800 INFO L231 Difference]: Finished difference. Result has 104 places, 62 transitions, 349 flow [2023-11-29 03:34:19,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=104, PETRI_TRANSITIONS=62} [2023-11-29 03:34:19,801 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 31 predicate places. [2023-11-29 03:34:19,801 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 62 transitions, 349 flow [2023-11-29 03:34:19,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:19,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:19,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:34:19,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 03:34:19,802 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:19,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash 637146169, now seen corresponding path program 3 times [2023-11-29 03:34:19,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:34:19,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578976048] [2023-11-29 03:34:19,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:19,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:34:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:34:19,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:34:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:34:19,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:34:19,952 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 03:34:19,953 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 03:34:19,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 03:34:19,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 03:34:19,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 03:34:19,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 03:34:19,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 03:34:19,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 03:34:19,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 03:34:19,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 03:34:19,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 03:34:19,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 03:34:19,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 03:34:19,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 03:34:19,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 03:34:19,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 03:34:19,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 03:34:19,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 03:34:19,958 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:34:19,963 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 03:34:19,964 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:34:20,029 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 03:34:20,032 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 03:34:20,036 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 03:34:20,039 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 03:34:20,049 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 03:34:20,050 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 03:34:20,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:34:20 BasicIcfg [2023-11-29 03:34:20,063 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:34:20,063 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:34:20,064 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:34:20,064 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:34:20,064 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:32:20" (3/4) ... [2023-11-29 03:34:20,066 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 03:34:20,067 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:34:20,067 INFO L158 Benchmark]: Toolchain (without parser) took 120968.87ms. Allocated memory was 146.8MB in the beginning and 11.4GB in the end (delta: 11.3GB). Free memory was 114.6MB in the beginning and 10.3GB in the end (delta: -10.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-29 03:34:20,067 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 146.8MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:34:20,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.78ms. Allocated memory is still 146.8MB. Free memory was 114.3MB in the beginning and 90.1MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 03:34:20,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.46ms. Allocated memory is still 146.8MB. Free memory was 90.1MB in the beginning and 87.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:34:20,068 INFO L158 Benchmark]: Boogie Preprocessor took 61.65ms. Allocated memory is still 146.8MB. Free memory was 87.5MB in the beginning and 83.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:34:20,069 INFO L158 Benchmark]: RCFGBuilder took 739.59ms. Allocated memory was 146.8MB in the beginning and 178.3MB in the end (delta: 31.5MB). Free memory was 83.6MB in the beginning and 111.7MB in the end (delta: -28.1MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2023-11-29 03:34:20,069 INFO L158 Benchmark]: TraceAbstraction took 119547.98ms. Allocated memory was 178.3MB in the beginning and 11.4GB in the end (delta: 11.2GB). Free memory was 111.7MB in the beginning and 10.3GB in the end (delta: -10.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-29 03:34:20,069 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 11.4GB. Free memory is still 10.3GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:34:20,071 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 146.8MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 554.78ms. Allocated memory is still 146.8MB. Free memory was 114.3MB in the beginning and 90.1MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.46ms. Allocated memory is still 146.8MB. Free memory was 90.1MB in the beginning and 87.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.65ms. Allocated memory is still 146.8MB. Free memory was 87.5MB in the beginning and 83.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 739.59ms. Allocated memory was 146.8MB in the beginning and 178.3MB in the end (delta: 31.5MB). Free memory was 83.6MB in the beginning and 111.7MB in the end (delta: -28.1MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * TraceAbstraction took 119547.98ms. Allocated memory was 178.3MB in the beginning and 11.4GB in the end (delta: 11.2GB). Free memory was 111.7MB in the beginning and 10.3GB in the end (delta: -10.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 11.4GB. Free memory is still 10.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t553; [L865] FCALL, FORK 0 pthread_create(&t553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t553={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L866] 0 pthread_t t554; [L867] FCALL, FORK 0 pthread_create(&t554, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t553={5:0}, t554={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L868] 0 pthread_t t555; [L869] FCALL, FORK 0 pthread_create(&t555, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t553={5:0}, t554={6:0}, t555={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L870] 0 pthread_t t556; [L871] FCALL, FORK 0 pthread_create(&t556, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice2=1, x=2, y=2, z=1] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice2=1, x=2, y=2, z=1] [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice2=1, x=2, y=2, z=1] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L17] 0 __assert_fail ("0", "mix021_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 99 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 119.3s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 113.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1600 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1401 mSDsluCounter, 445 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 325 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3739 IncrementalHoareTripleChecker+Invalid, 3835 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 120 mSDtfsCounter, 3739 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=772occurred in iteration=21, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 422 ConstructedInterpolants, 0 QuantifiedInterpolants, 2716 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 03:34:20,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:34:22,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:34:22,786 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 03:34:22,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:34:22,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:34:22,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:34:22,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:34:22,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:34:22,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:34:22,818 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:34:22,818 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:34:22,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:34:22,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:34:22,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:34:22,821 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:34:22,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:34:22,822 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:34:22,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:34:22,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:34:22,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:34:22,824 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:34:22,824 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:34:22,825 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:34:22,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:34:22,825 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:34:22,826 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:34:22,826 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:34:22,827 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:34:22,827 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:34:22,827 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:34:22,828 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:34:22,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:34:22,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:34:22,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:34:22,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:34:22,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:34:22,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:34:22,830 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:34:22,830 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:34:22,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:34:22,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:34:22,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:34:22,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:34:22,831 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:34:22,831 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/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_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc [2023-11-29 03:34:23,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:34:23,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:34:23,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:34:23,172 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:34:23,172 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:34:23,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 03:34:26,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:34:26,252 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:34:26,253 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 03:34:26,268 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/data/3d258d348/d2b1dc88a075452c817f4dbde8be25e7/FLAG0f4e1275c [2023-11-29 03:34:26,280 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/data/3d258d348/d2b1dc88a075452c817f4dbde8be25e7 [2023-11-29 03:34:26,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:34:26,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:34:26,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:34:26,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:34:26,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:34:26,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:34:26" (1/1) ... [2023-11-29 03:34:26,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fdae06c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:34:26, skipping insertion in model container [2023-11-29 03:34:26,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:34:26" (1/1) ... [2023-11-29 03:34:26,341 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:34:26,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:34:26,736 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:34:26,798 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:34:26,832 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:34:26,832 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:34:26,838 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:34:26,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:34:26 WrapperNode [2023-11-29 03:34:26,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:34:26,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:34:26,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:34:26,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:34:26,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:34:26" (1/1) ... [2023-11-29 03:34:26,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:34:26" (1/1) ... [2023-11-29 03:34:26,894 INFO L138 Inliner]: procedures = 180, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-29 03:34:26,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:34:26,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:34:26,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:34:26,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:34:26,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:34:26" (1/1) ... [2023-11-29 03:34:26,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:34:26" (1/1) ... [2023-11-29 03:34:26,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:34:26" (1/1) ... [2023-11-29 03:34:26,931 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 03:34:26,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:34:26" (1/1) ... [2023-11-29 03:34:26,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:34:26" (1/1) ... [2023-11-29 03:34:26,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:34:26" (1/1) ... [2023-11-29 03:34:26,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:34:26" (1/1) ... [2023-11-29 03:34:26,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:34:26" (1/1) ... [2023-11-29 03:34:26,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:34:26" (1/1) ... [2023-11-29 03:34:26,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:34:26,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:34:26,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:34:26,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:34:26,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:34:26" (1/1) ... [2023-11-29 03:34:26,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:34:26,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:34:26,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:34:26,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:34:27,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 03:34:27,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:34:27,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:34:27,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:34:27,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 03:34:27,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 03:34:27,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 03:34:27,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 03:34:27,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 03:34:27,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:34:27,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 03:34:27,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 03:34:27,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 03:34:27,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 03:34:27,024 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 03:34:27,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 03:34:27,024 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 03:34:27,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 03:34:27,024 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 03:34:27,025 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 03:34:27,025 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 03:34:27,025 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 03:34:27,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 03:34:27,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:34:27,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:34:27,027 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 03:34:27,208 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:34:27,211 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:34:27,615 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:34:27,842 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:34:27,843 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 03:34:27,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:34:27 BoogieIcfgContainer [2023-11-29 03:34:27,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:34:27,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:34:27,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:34:27,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:34:27,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:34:26" (1/3) ... [2023-11-29 03:34:27,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27dff23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:34:27, skipping insertion in model container [2023-11-29 03:34:27,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:34:26" (2/3) ... [2023-11-29 03:34:27,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27dff23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:34:27, skipping insertion in model container [2023-11-29 03:34:27,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:34:27" (3/3) ... [2023-11-29 03:34:27,852 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 03:34:27,871 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:34:27,872 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 03:34:27,872 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 03:34:27,939 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 03:34:27,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 03:34:28,010 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-29 03:34:28,018 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 03:34:28,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-11-29 03:34:28,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 03:34:28,027 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 62 transitions, 136 flow [2023-11-29 03:34:28,037 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:34:28,042 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@5658b347, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:34:28,042 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 03:34:28,045 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 03:34:28,046 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 03:34:28,046 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 03:34:28,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:28,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 03:34:28,047 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:28,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash 14291, now seen corresponding path program 1 times [2023-11-29 03:34:28,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:34:28,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494956403] [2023-11-29 03:34:28,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:28,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:28,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:34:28,068 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:34:28,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 03:34:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:28,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:34:28,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:28,273 INFO L378 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 7 [2023-11-29 03:34:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:34:28,287 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:34:28,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:34:28,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494956403] [2023-11-29 03:34:28,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494956403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:34:28,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:34:28,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:34:28,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481631293] [2023-11-29 03:34:28,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:34:28,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:34:28,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:34:28,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:34:28,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:34:28,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 03:34:28,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:28,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:34:28,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 03:34:28,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:34:29,711 INFO L124 PetriNetUnfolderBase]: 4217/7238 cut-off events. [2023-11-29 03:34:29,712 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 03:34:29,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13165 conditions, 7238 events. 4217/7238 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53851 event pairs, 3179 based on Foata normal form. 360/6962 useless extension candidates. Maximal degree in co-relation 13150. Up to 4391 conditions per place. [2023-11-29 03:34:29,801 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-29 03:34:29,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 226 flow [2023-11-29 03:34:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:34:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:34:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 03:34:29,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 03:34:29,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 03:34:29,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 03:34:29,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:34:29,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 03:34:29,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:29,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:29,827 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:29,829 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 136 flow. Second operand 3 states and 146 transitions. [2023-11-29 03:34:29,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 226 flow [2023-11-29 03:34:29,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 03:34:29,839 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 03:34:29,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-29 03:34:29,845 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-29 03:34:29,845 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 03:34:29,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:29,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:29,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 03:34:29,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:34:30,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:30,047 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:30,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:30,047 INFO L85 PathProgramCache]: Analyzing trace with hash 14292, now seen corresponding path program 1 times [2023-11-29 03:34:30,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:34:30,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639730319] [2023-11-29 03:34:30,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:30,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:30,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:34:30,050 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:34:30,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 03:34:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:30,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:34:30,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:30,147 INFO L378 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 [2023-11-29 03:34:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:34:30,158 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:34:30,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:34:30,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639730319] [2023-11-29 03:34:30,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639730319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:34:30,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:34:30,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:34:30,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247965465] [2023-11-29 03:34:30,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:34:30,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:34:30,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:34:30,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:34:30,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:34:30,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 03:34:30,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:30,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:34:30,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 03:34:30,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:34:31,344 INFO L124 PetriNetUnfolderBase]: 4217/7237 cut-off events. [2023-11-29 03:34:31,344 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 03:34:31,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13341 conditions, 7237 events. 4217/7237 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53752 event pairs, 3179 based on Foata normal form. 1/6602 useless extension candidates. Maximal degree in co-relation 13330. Up to 4390 conditions per place. [2023-11-29 03:34:31,462 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 35 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 03:34:31,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 222 flow [2023-11-29 03:34:31,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:34:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:34:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 03:34:31,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 03:34:31,464 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 03:34:31,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 03:34:31,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:34:31,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 03:34:31,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:31,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:31,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:31,469 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 146 transitions. [2023-11-29 03:34:31,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 222 flow [2023-11-29 03:34:31,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:34:31,481 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 03:34:31,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-29 03:34:31,482 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-29 03:34:31,483 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 03:34:31,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:31,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:31,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:34:31,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 03:34:31,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:31,684 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:31,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:31,685 INFO L85 PathProgramCache]: Analyzing trace with hash 426185003, now seen corresponding path program 1 times [2023-11-29 03:34:31,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:34:31,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450635618] [2023-11-29 03:34:31,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:31,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:31,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:34:31,687 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:34:31,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 03:34:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:31,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:34:31,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:31,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:34:31,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:34:31,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:34:31,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450635618] [2023-11-29 03:34:31,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450635618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:34:31,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:34:31,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:34:31,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266946176] [2023-11-29 03:34:31,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:34:31,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:34:31,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:34:31,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:34:31,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:34:31,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 03:34:31,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:31,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:34:31,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 03:34:31,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:34:32,486 INFO L124 PetriNetUnfolderBase]: 3311/5478 cut-off events. [2023-11-29 03:34:32,487 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-29 03:34:32,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10300 conditions, 5478 events. 3311/5478 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 39262 event pairs, 593 based on Foata normal form. 0/5401 useless extension candidates. Maximal degree in co-relation 10289. Up to 3661 conditions per place. [2023-11-29 03:34:32,529 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 41 selfloop transitions, 2 changer transitions 2/76 dead transitions. [2023-11-29 03:34:32,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 262 flow [2023-11-29 03:34:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:34:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:34:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2023-11-29 03:34:32,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7929292929292929 [2023-11-29 03:34:32,532 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 157 transitions. [2023-11-29 03:34:32,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 157 transitions. [2023-11-29 03:34:32,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:34:32,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 157 transitions. [2023-11-29 03:34:32,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:32,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:32,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:32,537 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 157 transitions. [2023-11-29 03:34:32,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 262 flow [2023-11-29 03:34:32,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:34:32,541 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 122 flow [2023-11-29 03:34:32,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-11-29 03:34:32,543 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-29 03:34:32,543 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 122 flow [2023-11-29 03:34:32,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:32,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:32,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:34:32,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 03:34:32,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:32,745 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:32,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:32,745 INFO L85 PathProgramCache]: Analyzing trace with hash 426183891, now seen corresponding path program 1 times [2023-11-29 03:34:32,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:34:32,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496801070] [2023-11-29 03:34:32,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:32,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:32,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:34:32,748 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:34:32,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 03:34:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:32,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:34:32,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:32,847 INFO L378 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 7 [2023-11-29 03:34:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:34:32,855 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:34:32,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:34:32,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496801070] [2023-11-29 03:34:32,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496801070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:34:32,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:34:32,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:34:32,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108768815] [2023-11-29 03:34:32,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:34:32,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:34:32,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:34:32,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:34:32,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:34:32,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 03:34:32,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:32,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:34:32,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 03:34:32,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:34:33,689 INFO L124 PetriNetUnfolderBase]: 2906/5134 cut-off events. [2023-11-29 03:34:33,690 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2023-11-29 03:34:33,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9546 conditions, 5134 events. 2906/5134 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 37402 event pairs, 2290 based on Foata normal form. 0/4885 useless extension candidates. Maximal degree in co-relation 9535. Up to 3466 conditions per place. [2023-11-29 03:34:33,717 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 03:34:33,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 212 flow [2023-11-29 03:34:33,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:34:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:34:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 03:34:33,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 03:34:33,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 03:34:33,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 03:34:33,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:34:33,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 03:34:33,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:33,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:33,722 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:33,722 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 141 transitions. [2023-11-29 03:34:33,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 212 flow [2023-11-29 03:34:33,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:34:33,724 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 03:34:33,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-29 03:34:33,725 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2023-11-29 03:34:33,725 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 03:34:33,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:33,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:33,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:34:33,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 03:34:33,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:33,926 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:33,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:33,927 INFO L85 PathProgramCache]: Analyzing trace with hash 426183892, now seen corresponding path program 1 times [2023-11-29 03:34:33,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:34:33,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954609722] [2023-11-29 03:34:33,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:33,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:33,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:34:33,929 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:34:33,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 03:34:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:34,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:34:34,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:34,020 INFO L378 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 [2023-11-29 03:34:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:34:34,030 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:34:34,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:34:34,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954609722] [2023-11-29 03:34:34,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954609722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:34:34,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:34:34,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:34:34,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341471679] [2023-11-29 03:34:34,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:34:34,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:34:34,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:34:34,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:34:34,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:34:34,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 03:34:34,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:34,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:34:34,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 03:34:34,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:34:34,677 INFO L124 PetriNetUnfolderBase]: 2903/5126 cut-off events. [2023-11-29 03:34:34,677 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 03:34:34,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9399 conditions, 5126 events. 2903/5126 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 37335 event pairs, 2288 based on Foata normal form. 4/4881 useless extension candidates. Maximal degree in co-relation 9389. Up to 3459 conditions per place. [2023-11-29 03:34:34,715 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 03:34:34,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 206 flow [2023-11-29 03:34:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:34:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:34:34,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 03:34:34,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 03:34:34,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 03:34:34,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 03:34:34,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:34:34,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 03:34:34,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:34,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:34,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:34,720 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 143 transitions. [2023-11-29 03:34:34,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 206 flow [2023-11-29 03:34:34,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:34:34,726 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 03:34:34,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-29 03:34:34,728 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-29 03:34:34,728 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 03:34:34,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:34,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:34,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:34:34,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-29 03:34:34,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:34,931 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:34,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:34,932 INFO L85 PathProgramCache]: Analyzing trace with hash 521406692, now seen corresponding path program 1 times [2023-11-29 03:34:34,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:34:34,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669173287] [2023-11-29 03:34:34,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:34,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:34,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:34:34,934 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:34:34,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 03:34:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:35,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:34:35,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:35,034 INFO L378 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 7 [2023-11-29 03:34:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:34:35,040 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:34:35,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:34:35,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669173287] [2023-11-29 03:34:35,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669173287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:34:35,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:34:35,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:34:35,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883809421] [2023-11-29 03:34:35,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:34:35,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:34:35,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:34:35,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:34:35,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:34:35,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 03:34:35,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:35,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:34:35,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 03:34:35,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:34:35,631 INFO L124 PetriNetUnfolderBase]: 2920/5121 cut-off events. [2023-11-29 03:34:35,632 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 03:34:35,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9423 conditions, 5121 events. 2920/5121 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 37030 event pairs, 1892 based on Foata normal form. 0/4895 useless extension candidates. Maximal degree in co-relation 9413. Up to 3460 conditions per place. [2023-11-29 03:34:35,658 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 03:34:35,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 206 flow [2023-11-29 03:34:35,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:34:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:34:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 03:34:35,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 03:34:35,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 03:34:35,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 03:34:35,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:34:35,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 03:34:35,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:35,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:35,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:35,662 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 141 transitions. [2023-11-29 03:34:35,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 206 flow [2023-11-29 03:34:35,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:34:35,666 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 03:34:35,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-29 03:34:35,667 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 03:34:35,667 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 03:34:35,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:35,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:35,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:34:35,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 03:34:35,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:35,872 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:35,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:35,872 INFO L85 PathProgramCache]: Analyzing trace with hash 521406693, now seen corresponding path program 1 times [2023-11-29 03:34:35,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:34:35,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221579959] [2023-11-29 03:34:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:35,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:35,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:34:35,875 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:34:35,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 03:34:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:35,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:34:35,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:35,989 INFO L378 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 [2023-11-29 03:34:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:34:35,997 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:34:35,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:34:35,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221579959] [2023-11-29 03:34:35,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221579959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:34:35,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:34:35,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:34:35,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353395290] [2023-11-29 03:34:35,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:34:35,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:34:35,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:34:35,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:34:35,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:34:36,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 03:34:36,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:36,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:34:36,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 03:34:36,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:34:36,553 INFO L124 PetriNetUnfolderBase]: 2903/5092 cut-off events. [2023-11-29 03:34:36,554 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 03:34:36,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9373 conditions, 5092 events. 2903/5092 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 36764 event pairs, 1884 based on Foata normal form. 12/4886 useless extension candidates. Maximal degree in co-relation 9363. Up to 3431 conditions per place. [2023-11-29 03:34:36,576 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 03:34:36,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 202 flow [2023-11-29 03:34:36,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:34:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:34:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 03:34:36,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 03:34:36,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 03:34:36,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 03:34:36,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:34:36,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 03:34:36,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:36,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:36,580 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:36,580 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 143 transitions. [2023-11-29 03:34:36,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 202 flow [2023-11-29 03:34:36,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:34:36,584 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 03:34:36,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-29 03:34:36,585 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-29 03:34:36,585 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 03:34:36,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:36,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:36,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:34:36,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 03:34:36,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:36,786 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:36,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:36,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1669512474, now seen corresponding path program 1 times [2023-11-29 03:34:36,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:34:36,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284506244] [2023-11-29 03:34:36,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:36,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:36,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:34:36,789 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:34:36,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 03:34:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:36,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:34:36,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:36,889 INFO L378 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 7 [2023-11-29 03:34:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:34:36,895 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:34:36,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:34:36,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284506244] [2023-11-29 03:34:36,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284506244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:34:36,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:34:36,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:34:36,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471983807] [2023-11-29 03:34:36,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:34:36,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:34:36,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:34:36,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:34:36,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:34:36,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 03:34:36,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:36,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:34:36,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 03:34:36,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:34:37,500 INFO L124 PetriNetUnfolderBase]: 2978/5123 cut-off events. [2023-11-29 03:34:37,500 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 03:34:37,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9515 conditions, 5123 events. 2978/5123 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 36550 event pairs, 1424 based on Foata normal form. 0/4969 useless extension candidates. Maximal degree in co-relation 9505. Up to 3426 conditions per place. [2023-11-29 03:34:37,524 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 03:34:37,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 202 flow [2023-11-29 03:34:37,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:34:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:34:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 03:34:37,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 03:34:37,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 03:34:37,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 03:34:37,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:34:37,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 03:34:37,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:37,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:37,527 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:37,527 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 141 transitions. [2023-11-29 03:34:37,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 202 flow [2023-11-29 03:34:37,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:34:37,531 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 03:34:37,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-29 03:34:37,532 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-29 03:34:37,532 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 03:34:37,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:37,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:37,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:34:37,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 03:34:37,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:37,733 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:37,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:37,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1669512473, now seen corresponding path program 1 times [2023-11-29 03:34:37,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:34:37,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450078689] [2023-11-29 03:34:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:37,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:37,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:34:37,736 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:34:37,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 03:34:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:37,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:34:37,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:37,852 INFO L378 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 [2023-11-29 03:34:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:34:37,861 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:34:37,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:34:37,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450078689] [2023-11-29 03:34:37,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450078689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:34:37,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:34:37,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:34:37,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546075637] [2023-11-29 03:34:37,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:34:37,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:34:37,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:34:37,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:34:37,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:34:37,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 03:34:37,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:37,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:34:37,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 03:34:37,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:34:38,569 INFO L124 PetriNetUnfolderBase]: 2903/5072 cut-off events. [2023-11-29 03:34:38,570 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 03:34:38,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9377 conditions, 5072 events. 2903/5072 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 36425 event pairs, 920 based on Foata normal form. 36/4990 useless extension candidates. Maximal degree in co-relation 9367. Up to 3315 conditions per place. [2023-11-29 03:34:38,599 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 03:34:38,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 198 flow [2023-11-29 03:34:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:34:38,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:34:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 03:34:38,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 03:34:38,600 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 03:34:38,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 03:34:38,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:34:38,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 03:34:38,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:38,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:38,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:38,602 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 143 transitions. [2023-11-29 03:34:38,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 198 flow [2023-11-29 03:34:38,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:34:38,605 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-29 03:34:38,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-11-29 03:34:38,606 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -13 predicate places. [2023-11-29 03:34:38,606 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-29 03:34:38,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:38,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:38,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:34:38,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 03:34:38,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:38,808 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:38,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1158839862, now seen corresponding path program 1 times [2023-11-29 03:34:38,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:34:38,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836704521] [2023-11-29 03:34:38,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:38,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:38,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:34:38,810 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:34:38,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 03:34:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:38,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:34:38,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:34:38,961 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:34:38,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:34:38,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836704521] [2023-11-29 03:34:38,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836704521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:34:38,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:34:38,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:34:38,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895607007] [2023-11-29 03:34:38,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:34:38,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:34:38,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:34:38,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:34:38,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:34:38,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 03:34:38,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:38,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:34:38,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 03:34:38,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:34:40,347 INFO L124 PetriNetUnfolderBase]: 9971/15473 cut-off events. [2023-11-29 03:34:40,347 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2023-11-29 03:34:40,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29698 conditions, 15473 events. 9971/15473 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 111742 event pairs, 1033 based on Foata normal form. 400/15729 useless extension candidates. Maximal degree in co-relation 29688. Up to 8761 conditions per place. [2023-11-29 03:34:40,421 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 54 selfloop transitions, 6 changer transitions 1/81 dead transitions. [2023-11-29 03:34:40,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 81 transitions, 304 flow [2023-11-29 03:34:40,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:34:40,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 03:34:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2023-11-29 03:34:40,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7234848484848485 [2023-11-29 03:34:40,423 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 191 transitions. [2023-11-29 03:34:40,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 191 transitions. [2023-11-29 03:34:40,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:34:40,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 191 transitions. [2023-11-29 03:34:40,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:40,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:40,426 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:40,426 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 4 states and 191 transitions. [2023-11-29 03:34:40,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 81 transitions, 304 flow [2023-11-29 03:34:40,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:34:40,437 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 148 flow [2023-11-29 03:34:40,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2023-11-29 03:34:40,438 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 03:34:40,439 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 148 flow [2023-11-29 03:34:40,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:40,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:40,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:34:40,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 03:34:40,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:40,640 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:40,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:40,640 INFO L85 PathProgramCache]: Analyzing trace with hash 190530853, now seen corresponding path program 1 times [2023-11-29 03:34:40,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:34:40,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791076611] [2023-11-29 03:34:40,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:40,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:40,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:34:40,642 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:34:40,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 03:34:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:40,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:34:40,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:40,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:34:40,804 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:34:40,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:34:40,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791076611] [2023-11-29 03:34:40,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791076611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:34:40,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:34:40,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:34:40,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720515270] [2023-11-29 03:34:40,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:34:40,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:34:40,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:34:40,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:34:40,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:34:40,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 03:34:40,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:40,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:34:40,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 03:34:40,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:34:41,855 INFO L124 PetriNetUnfolderBase]: 7427/11573 cut-off events. [2023-11-29 03:34:41,855 INFO L125 PetriNetUnfolderBase]: For 2580/2580 co-relation queries the response was YES. [2023-11-29 03:34:41,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25501 conditions, 11573 events. 7427/11573 cut-off events. For 2580/2580 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 79288 event pairs, 451 based on Foata normal form. 364/11804 useless extension candidates. Maximal degree in co-relation 25488. Up to 5521 conditions per place. [2023-11-29 03:34:41,910 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 69 selfloop transitions, 10 changer transitions 1/100 dead transitions. [2023-11-29 03:34:41,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 100 transitions, 431 flow [2023-11-29 03:34:41,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:34:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 03:34:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2023-11-29 03:34:41,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 03:34:41,912 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 242 transitions. [2023-11-29 03:34:41,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 242 transitions. [2023-11-29 03:34:41,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:34:41,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 242 transitions. [2023-11-29 03:34:41,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:41,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:41,914 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:41,914 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 148 flow. Second operand 5 states and 242 transitions. [2023-11-29 03:34:41,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 100 transitions, 431 flow [2023-11-29 03:34:41,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 100 transitions, 420 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 03:34:41,918 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 200 flow [2023-11-29 03:34:41,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2023-11-29 03:34:41,919 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-29 03:34:41,919 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 200 flow [2023-11-29 03:34:41,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:41,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:41,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:34:41,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 03:34:42,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:42,121 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:42,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:42,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1964038621, now seen corresponding path program 1 times [2023-11-29 03:34:42,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:34:42,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374671646] [2023-11-29 03:34:42,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:42,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:42,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:34:42,123 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:34:42,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 03:34:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:42,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:34:42,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:42,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:34:42,296 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:34:42,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:34:42,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374671646] [2023-11-29 03:34:42,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374671646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:34:42,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:34:42,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:34:42,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470277687] [2023-11-29 03:34:42,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:34:42,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:34:42,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:34:42,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:34:42,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:34:42,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 03:34:42,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:42,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:34:42,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 03:34:42,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:34:43,063 INFO L124 PetriNetUnfolderBase]: 4491/6889 cut-off events. [2023-11-29 03:34:43,063 INFO L125 PetriNetUnfolderBase]: For 4846/4846 co-relation queries the response was YES. [2023-11-29 03:34:43,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17123 conditions, 6889 events. 4491/6889 cut-off events. For 4846/4846 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 41059 event pairs, 289 based on Foata normal form. 244/7011 useless extension candidates. Maximal degree in co-relation 17108. Up to 1969 conditions per place. [2023-11-29 03:34:43,096 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 82 selfloop transitions, 14 changer transitions 1/117 dead transitions. [2023-11-29 03:34:43,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 117 transitions, 562 flow [2023-11-29 03:34:43,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:34:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 03:34:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 291 transitions. [2023-11-29 03:34:43,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2023-11-29 03:34:43,133 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 291 transitions. [2023-11-29 03:34:43,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 291 transitions. [2023-11-29 03:34:43,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:34:43,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 291 transitions. [2023-11-29 03:34:43,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:43,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:43,135 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:43,135 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 200 flow. Second operand 6 states and 291 transitions. [2023-11-29 03:34:43,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 117 transitions, 562 flow [2023-11-29 03:34:43,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 117 transitions, 532 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 03:34:43,156 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 250 flow [2023-11-29 03:34:43,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-11-29 03:34:43,157 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2023-11-29 03:34:43,157 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 250 flow [2023-11-29 03:34:43,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:43,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:43,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:34:43,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 03:34:43,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:43,358 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:43,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2111306923, now seen corresponding path program 1 times [2023-11-29 03:34:43,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:34:43,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123981271] [2023-11-29 03:34:43,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:43,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:43,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:34:43,360 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:34:43,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 03:34:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:43,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:34:43,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:34:43,543 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:34:43,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:34:43,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123981271] [2023-11-29 03:34:43,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123981271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:34:43,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:34:43,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:34:43,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743484682] [2023-11-29 03:34:43,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:34:43,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:34:43,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:34:43,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:34:43,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:34:43,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 03:34:43,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:43,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:34:43,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 03:34:43,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:34:44,268 INFO L124 PetriNetUnfolderBase]: 2927/4297 cut-off events. [2023-11-29 03:34:44,268 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES. [2023-11-29 03:34:44,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11820 conditions, 4297 events. 2927/4297 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 22480 event pairs, 231 based on Foata normal form. 96/4271 useless extension candidates. Maximal degree in co-relation 11804. Up to 1316 conditions per place. [2023-11-29 03:34:44,289 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 73 selfloop transitions, 18 changer transitions 1/112 dead transitions. [2023-11-29 03:34:44,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 112 transitions, 552 flow [2023-11-29 03:34:44,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:34:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 03:34:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 318 transitions. [2023-11-29 03:34:44,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6883116883116883 [2023-11-29 03:34:44,291 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 318 transitions. [2023-11-29 03:34:44,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 318 transitions. [2023-11-29 03:34:44,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:34:44,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 318 transitions. [2023-11-29 03:34:44,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.42857142857143) internal successors, (318), 7 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:44,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:44,294 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:44,294 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 250 flow. Second operand 7 states and 318 transitions. [2023-11-29 03:34:44,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 112 transitions, 552 flow [2023-11-29 03:34:44,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 112 transitions, 506 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 03:34:44,335 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 260 flow [2023-11-29 03:34:44,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=260, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2023-11-29 03:34:44,336 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-29 03:34:44,336 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 260 flow [2023-11-29 03:34:44,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:34:44,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:34:44,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:34:44,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 03:34:44,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:44,537 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:34:44,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:44,537 INFO L85 PathProgramCache]: Analyzing trace with hash -196299898, now seen corresponding path program 1 times [2023-11-29 03:34:44,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:34:44,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211481774] [2023-11-29 03:34:44,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:44,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:34:44,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:34:44,539 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:34:44,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 03:34:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:44,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 03:34:44,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:54,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:34:54,068 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:34:54,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:34:54,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211481774] [2023-11-29 03:34:54,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211481774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:34:54,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:34:54,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:34:54,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313965194] [2023-11-29 03:34:54,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:34:54,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:34:54,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:34:54,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:34:54,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=30, Unknown=1, NotChecked=0, Total=42 [2023-11-29 03:34:58,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:35:02,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:35:06,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:35:10,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:35:14,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:35:18,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:35:23,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:35:27,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:35:31,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:35:33,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:35:37,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:35:37,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2023-11-29 03:35:37,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:35:37,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:35:37,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2023-11-29 03:35:37,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:35:40,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:35:44,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:35:49,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:35:53,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:35:57,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:02,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:06,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:10,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:14,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:18,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:22,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:26,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:30,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:33,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:37,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:41,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:43,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:47,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:51,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:55,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:59,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:01,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:05,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:09,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:13,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:13,916 INFO L124 PetriNetUnfolderBase]: 1557/2738 cut-off events. [2023-11-29 03:37:13,916 INFO L125 PetriNetUnfolderBase]: For 1167/1263 co-relation queries the response was YES. [2023-11-29 03:37:13,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6213 conditions, 2738 events. 1557/2738 cut-off events. For 1167/1263 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 16759 event pairs, 584 based on Foata normal form. 16/2565 useless extension candidates. Maximal degree in co-relation 6195. Up to 1876 conditions per place. [2023-11-29 03:37:13,931 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 38 selfloop transitions, 4 changer transitions 5/79 dead transitions. [2023-11-29 03:37:13,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 79 transitions, 390 flow [2023-11-29 03:37:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:37:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 03:37:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 216 transitions. [2023-11-29 03:37:13,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2023-11-29 03:37:13,933 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 216 transitions. [2023-11-29 03:37:13,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 216 transitions. [2023-11-29 03:37:13,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:37:13,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 216 transitions. [2023-11-29 03:37:13,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:13,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:13,935 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:13,935 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 260 flow. Second operand 7 states and 216 transitions. [2023-11-29 03:37:13,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 79 transitions, 390 flow [2023-11-29 03:37:13,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 79 transitions, 294 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-29 03:37:13,948 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 168 flow [2023-11-29 03:37:13,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2023-11-29 03:37:13,948 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-29 03:37:13,948 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 168 flow [2023-11-29 03:37:13,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:13,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:37:13,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:37:13,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 03:37:14,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:37:14,149 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:37:14,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:37:14,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2118870925, now seen corresponding path program 1 times [2023-11-29 03:37:14,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:37:14,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91924682] [2023-11-29 03:37:14,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:37:14,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:37:14,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:37:14,152 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:37:14,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 03:37:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:14,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 03:37:14,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:37:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:37:15,137 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:37:15,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:37:15,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91924682] [2023-11-29 03:37:15,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91924682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:37:15,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:37:15,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:37:15,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558455597] [2023-11-29 03:37:15,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:37:15,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:37:15,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:37:15,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:37:15,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:37:15,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 03:37:15,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 168 flow. Second operand has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:15,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:37:15,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 03:37:15,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:37:16,074 INFO L124 PetriNetUnfolderBase]: 2125/3563 cut-off events. [2023-11-29 03:37:16,074 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-11-29 03:37:16,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7071 conditions, 3563 events. 2125/3563 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 22424 event pairs, 419 based on Foata normal form. 16/3347 useless extension candidates. Maximal degree in co-relation 7059. Up to 1087 conditions per place. [2023-11-29 03:37:16,089 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 56 selfloop transitions, 5 changer transitions 16/112 dead transitions. [2023-11-29 03:37:16,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 112 transitions, 452 flow [2023-11-29 03:37:16,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:37:16,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 03:37:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 402 transitions. [2023-11-29 03:37:16,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6767676767676768 [2023-11-29 03:37:16,091 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 402 transitions. [2023-11-29 03:37:16,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 402 transitions. [2023-11-29 03:37:16,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:37:16,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 402 transitions. [2023-11-29 03:37:16,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 44.666666666666664) internal successors, (402), 9 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:16,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:16,094 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:16,094 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 168 flow. Second operand 9 states and 402 transitions. [2023-11-29 03:37:16,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 112 transitions, 452 flow [2023-11-29 03:37:16,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 112 transitions, 435 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 03:37:16,096 INFO L231 Difference]: Finished difference. Result has 74 places, 60 transitions, 184 flow [2023-11-29 03:37:16,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=74, PETRI_TRANSITIONS=60} [2023-11-29 03:37:16,097 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 1 predicate places. [2023-11-29 03:37:16,097 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 60 transitions, 184 flow [2023-11-29 03:37:16,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:16,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:37:16,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:37:16,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 03:37:16,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:37:16,298 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:37:16,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:37:16,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1031547427, now seen corresponding path program 2 times [2023-11-29 03:37:16,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:37:16,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987223356] [2023-11-29 03:37:16,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:37:16,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:37:16,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:37:16,300 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:37:16,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 03:37:16,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 03:37:16,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:37:16,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:37:16,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:37:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:37:16,492 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:37:16,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:37:16,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987223356] [2023-11-29 03:37:16,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987223356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:37:16,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:37:16,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:37:16,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434570486] [2023-11-29 03:37:16,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:37:16,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:37:16,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:37:16,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:37:16,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:37:16,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 03:37:16,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 60 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:16,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:37:16,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 03:37:16,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:37:17,270 INFO L124 PetriNetUnfolderBase]: 4554/7574 cut-off events. [2023-11-29 03:37:17,270 INFO L125 PetriNetUnfolderBase]: For 883/1039 co-relation queries the response was YES. [2023-11-29 03:37:17,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16033 conditions, 7574 events. 4554/7574 cut-off events. For 883/1039 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 53892 event pairs, 2149 based on Foata normal form. 29/7073 useless extension candidates. Maximal degree in co-relation 16017. Up to 3233 conditions per place. [2023-11-29 03:37:17,295 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 39 selfloop transitions, 2 changer transitions 16/90 dead transitions. [2023-11-29 03:37:17,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 90 transitions, 380 flow [2023-11-29 03:37:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:37:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 03:37:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2023-11-29 03:37:17,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6848484848484848 [2023-11-29 03:37:17,297 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 226 transitions. [2023-11-29 03:37:17,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 226 transitions. [2023-11-29 03:37:17,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:37:17,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 226 transitions. [2023-11-29 03:37:17,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:17,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:17,299 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:17,299 INFO L175 Difference]: Start difference. First operand has 74 places, 60 transitions, 184 flow. Second operand 5 states and 226 transitions. [2023-11-29 03:37:17,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 90 transitions, 380 flow [2023-11-29 03:37:17,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 90 transitions, 362 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-29 03:37:17,315 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 183 flow [2023-11-29 03:37:17,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2023-11-29 03:37:17,316 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -1 predicate places. [2023-11-29 03:37:17,316 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 183 flow [2023-11-29 03:37:17,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:17,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:37:17,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:37:17,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 03:37:17,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:37:17,517 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:37:17,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:37:17,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2081449185, now seen corresponding path program 3 times [2023-11-29 03:37:17,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:37:17,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023729464] [2023-11-29 03:37:17,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 03:37:17,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:37:17,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:37:17,519 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:37:17,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 03:37:17,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 03:37:17,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:37:17,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:37:17,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:37:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:37:17,688 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:37:17,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:37:17,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023729464] [2023-11-29 03:37:17,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023729464] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:37:17,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:37:17,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:37:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958049011] [2023-11-29 03:37:17,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:37:17,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:37:17,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:37:17,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:37:17,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:37:17,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 03:37:17,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:17,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:37:17,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 03:37:17,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:37:18,681 INFO L124 PetriNetUnfolderBase]: 6302/10530 cut-off events. [2023-11-29 03:37:18,681 INFO L125 PetriNetUnfolderBase]: For 790/790 co-relation queries the response was YES. [2023-11-29 03:37:18,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22106 conditions, 10530 events. 6302/10530 cut-off events. For 790/790 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 77627 event pairs, 2429 based on Foata normal form. 16/9875 useless extension candidates. Maximal degree in co-relation 22091. Up to 4153 conditions per place. [2023-11-29 03:37:18,716 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 37 selfloop transitions, 2 changer transitions 15/88 dead transitions. [2023-11-29 03:37:18,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 362 flow [2023-11-29 03:37:18,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:37:18,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 03:37:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2023-11-29 03:37:18,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2023-11-29 03:37:18,717 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 225 transitions. [2023-11-29 03:37:18,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 225 transitions. [2023-11-29 03:37:18,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:37:18,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 225 transitions. [2023-11-29 03:37:18,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:18,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:18,720 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:18,720 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 183 flow. Second operand 5 states and 225 transitions. [2023-11-29 03:37:18,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 362 flow [2023-11-29 03:37:18,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 88 transitions, 350 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-29 03:37:18,723 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 191 flow [2023-11-29 03:37:18,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2023-11-29 03:37:18,723 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -1 predicate places. [2023-11-29 03:37:18,723 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 191 flow [2023-11-29 03:37:18,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:18,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:37:18,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:37:18,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 03:37:18,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:37:18,924 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:37:18,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:37:18,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1520573777, now seen corresponding path program 4 times [2023-11-29 03:37:18,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:37:18,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562669978] [2023-11-29 03:37:18,925 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 03:37:18,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:37:18,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:37:18,926 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:37:18,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 03:37:19,048 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 03:37:19,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:37:19,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:37:19,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:37:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:37:19,119 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:37:19,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:37:19,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562669978] [2023-11-29 03:37:19,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562669978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:37:19,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:37:19,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:37:19,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328853766] [2023-11-29 03:37:19,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:37:19,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:37:19,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:37:19,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:37:19,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:37:19,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 03:37:19,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:19,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:37:19,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 03:37:19,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:37:20,795 INFO L124 PetriNetUnfolderBase]: 10911/17896 cut-off events. [2023-11-29 03:37:20,795 INFO L125 PetriNetUnfolderBase]: For 1238/1238 co-relation queries the response was YES. [2023-11-29 03:37:20,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36270 conditions, 17896 events. 10911/17896 cut-off events. For 1238/1238 co-relation queries the response was YES. Maximal size of possible extension queue 1158. Compared 141705 event pairs, 2932 based on Foata normal form. 16/16724 useless extension candidates. Maximal degree in co-relation 36254. Up to 6473 conditions per place. [2023-11-29 03:37:20,850 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 31 selfloop transitions, 1 changer transitions 26/93 dead transitions. [2023-11-29 03:37:20,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 93 transitions, 382 flow [2023-11-29 03:37:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:37:20,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 03:37:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 263 transitions. [2023-11-29 03:37:20,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6641414141414141 [2023-11-29 03:37:20,852 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 263 transitions. [2023-11-29 03:37:20,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 263 transitions. [2023-11-29 03:37:20,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:37:20,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 263 transitions. [2023-11-29 03:37:20,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 43.833333333333336) internal successors, (263), 6 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:20,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:20,854 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:20,854 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 191 flow. Second operand 6 states and 263 transitions. [2023-11-29 03:37:20,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 93 transitions, 382 flow [2023-11-29 03:37:20,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 93 transitions, 374 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-29 03:37:20,857 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 196 flow [2023-11-29 03:37:20,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=76, PETRI_TRANSITIONS=61} [2023-11-29 03:37:20,857 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2023-11-29 03:37:20,858 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 196 flow [2023-11-29 03:37:20,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:37:20,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:37:20,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:37:20,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 03:37:21,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:37:21,058 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 03:37:21,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:37:21,059 INFO L85 PathProgramCache]: Analyzing trace with hash -673235859, now seen corresponding path program 5 times [2023-11-29 03:37:21,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:37:21,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218787996] [2023-11-29 03:37:21,059 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 03:37:21,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:37:21,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:37:21,060 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:37:21,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 03:37:21,208 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 03:37:21,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 03:37:21,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:37:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:37:21,385 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 03:37:21,385 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 03:37:21,386 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 03:37:21,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 03:37:21,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 03:37:21,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 03:37:21,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 03:37:21,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 03:37:21,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 03:37:21,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 03:37:21,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 03:37:21,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 03:37:21,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 03:37:21,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 03:37:21,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 03:37:21,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 03:37:21,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 03:37:21,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 03:37:21,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 03:37:21,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:37:21,590 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:37:21,595 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 03:37:21,595 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:37:21,656 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 03:37:21,659 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 03:37:21,663 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 03:37:21,666 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 03:37:21,678 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 03:37:21,679 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 03:37:21,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:37:21 BasicIcfg [2023-11-29 03:37:21,693 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:37:21,694 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:37:21,694 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:37:21,694 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:37:21,695 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:34:27" (3/4) ... [2023-11-29 03:37:21,696 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 03:37:21,698 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:37:21,698 INFO L158 Benchmark]: Toolchain (without parser) took 175413.97ms. Allocated memory was 69.2MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 44.3MB in the beginning and 879.0MB in the end (delta: -834.6MB). Peak memory consumption was 692.8MB. Max. memory is 16.1GB. [2023-11-29 03:37:21,699 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 69.2MB. Free memory was 45.3MB in the beginning and 45.2MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:37:21,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.40ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 44.2MB in the beginning and 56.9MB in the end (delta: -12.8MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2023-11-29 03:37:21,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.17ms. Allocated memory is still 90.2MB. Free memory was 56.9MB in the beginning and 54.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:37:21,700 INFO L158 Benchmark]: Boogie Preprocessor took 66.29ms. Allocated memory is still 90.2MB. Free memory was 54.3MB in the beginning and 50.6MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:37:21,700 INFO L158 Benchmark]: RCFGBuilder took 881.14ms. Allocated memory is still 90.2MB. Free memory was 50.6MB in the beginning and 50.6MB in the end (delta: -14.5kB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2023-11-29 03:37:21,700 INFO L158 Benchmark]: TraceAbstraction took 173847.96ms. Allocated memory was 90.2MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 50.0MB in the beginning and 879.0MB in the end (delta: -828.9MB). Peak memory consumption was 674.9MB. Max. memory is 16.1GB. [2023-11-29 03:37:21,701 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 1.6GB. Free memory is still 879.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:37:21,703 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 69.2MB. Free memory was 45.3MB in the beginning and 45.2MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 553.40ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 44.2MB in the beginning and 56.9MB in the end (delta: -12.8MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.17ms. Allocated memory is still 90.2MB. Free memory was 56.9MB in the beginning and 54.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.29ms. Allocated memory is still 90.2MB. Free memory was 54.3MB in the beginning and 50.6MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 881.14ms. Allocated memory is still 90.2MB. Free memory was 50.6MB in the beginning and 50.6MB in the end (delta: -14.5kB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * TraceAbstraction took 173847.96ms. Allocated memory was 90.2MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 50.0MB in the beginning and 879.0MB in the end (delta: -828.9MB). Peak memory consumption was 674.9MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 1.6GB. Free memory is still 879.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t553; [L865] FCALL, FORK 0 pthread_create(&t553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t553={-12:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t554; [L867] FCALL, FORK 0 pthread_create(&t554, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t553={-12:0}, t554={-16:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L868] 0 pthread_t t555; [L869] FCALL, FORK 0 pthread_create(&t555, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t553={-12:0}, t554={-16:0}, t555={-6:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L870] 0 pthread_t t556; [L871] FCALL, FORK 0 pthread_create(&t556, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t553={-12:0}, t554={-16:0}, t555={-6:0}, t556={-8:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t553={-12:0}, t554={-16:0}, t555={-6:0}, t556={-8:0}, weak$$choice2=0, x=2, y=2, z=1] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t553={-12:0}, t554={-16:0}, t555={-6:0}, t556={-8:0}, weak$$choice2=0, x=2, y=2, z=1] [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t553={-12:0}, t554={-16:0}, t555={-6:0}, t556={-8:0}, weak$$choice2=0, x=2, y=2, z=1] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L17] 0 __assert_fail ("0", "mix021_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 99 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 173.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 156.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 31 mSolverCounterUnknown, 973 SdHoareTripleChecker+Valid, 142.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 808 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 141.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2628 IncrementalHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 36 mSDtfsCounter, 2628 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=13, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 363 ConstructedInterpolants, 20 QuantifiedInterpolants, 3681 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2519 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 03:37:21,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9e8ac91-29cb-4ea7-99ea-281532226c9b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample