./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB --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 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:20:29,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:20:30,082 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 03:20:30,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:20:30,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:20:30,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:20:30,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:20:30,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:20:30,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:20:30,126 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:20:30,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:20:30,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:20:30,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:20:30,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:20:30,129 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:20:30,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:20:30,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:20:30,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:20:30,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:20:30,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:20:30,130 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:20:30,130 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:20:30,130 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:20:30,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:20:30,130 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:20:30,130 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:20:30,131 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:20:30,131 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:20:30,131 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:20:30,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:20:30,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:20:30,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:20:30,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:20:30,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:20:30,131 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:20:30,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:20:30,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:20:30,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:20:30,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:20:30,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:20:30,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:20:30,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:20:30,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:20:30,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:20:30,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:20:30,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:20:30,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:20:30,132 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b [2024-11-28 03:20:30,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:20:30,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:20:30,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:20:30,493 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:20:30,493 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:20:30,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2024-11-28 03:20:33,436 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/data/3f22ab35d/8ce4fe8fdb9e432c83df56edcf5dc3f1/FLAG8c6fca93f [2024-11-28 03:20:33,812 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:20:33,813 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2024-11-28 03:20:33,838 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/data/3f22ab35d/8ce4fe8fdb9e432c83df56edcf5dc3f1/FLAG8c6fca93f [2024-11-28 03:20:34,007 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/data/3f22ab35d/8ce4fe8fdb9e432c83df56edcf5dc3f1 [2024-11-28 03:20:34,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:20:34,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:20:34,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:20:34,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:20:34,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:20:34,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:34" (1/1) ... [2024-11-28 03:20:34,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27fde38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:34, skipping insertion in model container [2024-11-28 03:20:34,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:34" (1/1) ... [2024-11-28 03:20:34,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:20:34,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:20:34,558 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:20:34,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:20:34,654 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:20:34,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:34 WrapperNode [2024-11-28 03:20:34,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:20:34,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:20:34,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:20:34,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:20:34,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:34" (1/1) ... [2024-11-28 03:20:34,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:34" (1/1) ... [2024-11-28 03:20:34,699 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 122 [2024-11-28 03:20:34,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:20:34,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:20:34,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:20:34,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:20:34,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:34" (1/1) ... [2024-11-28 03:20:34,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:34" (1/1) ... [2024-11-28 03:20:34,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:34" (1/1) ... [2024-11-28 03:20:34,738 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-28 03:20:34,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:34" (1/1) ... [2024-11-28 03:20:34,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:34" (1/1) ... [2024-11-28 03:20:34,746 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:34" (1/1) ... [2024-11-28 03:20:34,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:34" (1/1) ... [2024-11-28 03:20:34,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:34" (1/1) ... [2024-11-28 03:20:34,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:34" (1/1) ... [2024-11-28 03:20:34,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:34" (1/1) ... [2024-11-28 03:20:34,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:20:34,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:20:34,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:20:34,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:20:34,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:34" (1/1) ... [2024-11-28 03:20:34,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:20:34,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:34,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:20:34,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:20:34,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 03:20:34,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:20:34,820 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-28 03:20:34,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-28 03:20:34,821 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-28 03:20:34,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-28 03:20:34,821 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-28 03:20:34,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-28 03:20:34,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:20:34,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 03:20:34,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:20:34,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:20:34,823 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:20:34,972 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:20:34,974 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:20:35,386 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:20:35,386 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:20:35,701 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:20:35,703 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 03:20:35,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:35 BoogieIcfgContainer [2024-11-28 03:20:35,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:20:35,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:20:35,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:20:35,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:20:35,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:20:34" (1/3) ... [2024-11-28 03:20:35,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2a9fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:20:35, skipping insertion in model container [2024-11-28 03:20:35,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:34" (2/3) ... [2024-11-28 03:20:35,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2a9fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:20:35, skipping insertion in model container [2024-11-28 03:20:35,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:35" (3/3) ... [2024-11-28 03:20:35,715 INFO L128 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i [2024-11-28 03:20:35,730 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:20:35,734 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i that has 4 procedures, 46 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-28 03:20:35,734 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:20:35,810 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 03:20:35,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2024-11-28 03:20:35,904 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-11-28 03:20:35,909 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:20:35,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-11-28 03:20:35,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2024-11-28 03:20:35,918 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2024-11-28 03:20:35,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:20:35,953 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@66e9425c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:20:35,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-28 03:20:35,960 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:20:35,961 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-28 03:20:35,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:20:35,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:35,961 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-28 03:20:35,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:20:35,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:35,968 INFO L85 PathProgramCache]: Analyzing trace with hash 12370397, now seen corresponding path program 1 times [2024-11-28 03:20:35,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:35,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984655466] [2024-11-28 03:20:35,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:35,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:36,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:36,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984655466] [2024-11-28 03:20:36,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984655466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:36,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:36,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 03:20:36,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688447796] [2024-11-28 03:20:36,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:36,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:20:36,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:36,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:20:36,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:20:36,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-11-28 03:20:36,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:36,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:20:36,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-11-28 03:20:36,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:20:37,287 INFO L124 PetriNetUnfolderBase]: 825/1532 cut-off events. [2024-11-28 03:20:37,287 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-28 03:20:37,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2813 conditions, 1532 events. 825/1532 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10238 event pairs, 129 based on Foata normal form. 96/1605 useless extension candidates. Maximal degree in co-relation 2802. Up to 1009 conditions per place. [2024-11-28 03:20:37,309 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 33 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-11-28 03:20:37,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 201 flow [2024-11-28 03:20:37,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:20:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:20:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-11-28 03:20:37,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7659574468085106 [2024-11-28 03:20:37,326 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 108 transitions. [2024-11-28 03:20:37,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 201 flow [2024-11-28 03:20:37,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 196 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 03:20:37,340 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2024-11-28 03:20:37,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-28 03:20:37,349 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-11-28 03:20:37,350 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2024-11-28 03:20:37,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:37,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:37,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:37,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:20:37,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:20:37,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:37,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2067410651, now seen corresponding path program 1 times [2024-11-28 03:20:37,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:37,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285870626] [2024-11-28 03:20:37,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:37,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:37,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:37,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285870626] [2024-11-28 03:20:37,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285870626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:37,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:37,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 03:20:37,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253567759] [2024-11-28 03:20:37,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:37,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:20:37,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:37,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:20:37,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:20:37,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-11-28 03:20:37,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:37,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:20:37,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-11-28 03:20:37,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:20:37,876 INFO L124 PetriNetUnfolderBase]: 721/1393 cut-off events. [2024-11-28 03:20:37,876 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-28 03:20:37,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2613 conditions, 1393 events. 721/1393 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9272 event pairs, 721 based on Foata normal form. 48/1382 useless extension candidates. Maximal degree in co-relation 2603. Up to 1090 conditions per place. [2024-11-28 03:20:37,889 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 18 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2024-11-28 03:20:37,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 126 flow [2024-11-28 03:20:37,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:20:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:20:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-11-28 03:20:37,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-11-28 03:20:37,891 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 84 transitions. [2024-11-28 03:20:37,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 126 flow [2024-11-28 03:20:37,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:20:37,893 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 82 flow [2024-11-28 03:20:37,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-28 03:20:37,894 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2024-11-28 03:20:37,894 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 82 flow [2024-11-28 03:20:37,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:37,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:37,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:37,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:20:37,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:20:37,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:37,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2067412078, now seen corresponding path program 1 times [2024-11-28 03:20:37,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:37,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302589425] [2024-11-28 03:20:37,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:37,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:38,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:38,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302589425] [2024-11-28 03:20:38,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302589425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:38,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:38,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:20:38,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188533396] [2024-11-28 03:20:38,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:38,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:20:38,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:38,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:20:38,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:20:38,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-11-28 03:20:38,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:38,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:20:38,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-11-28 03:20:38,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:20:40,209 INFO L124 PetriNetUnfolderBase]: 5830/9420 cut-off events. [2024-11-28 03:20:40,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:20:40,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18044 conditions, 9420 events. 5830/9420 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 66016 event pairs, 1524 based on Foata normal form. 0/9115 useless extension candidates. Maximal degree in co-relation 18038. Up to 3832 conditions per place. [2024-11-28 03:20:40,268 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 38 selfloop transitions, 7 changer transitions 83/139 dead transitions. [2024-11-28 03:20:40,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 139 transitions, 544 flow [2024-11-28 03:20:40,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:20:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 03:20:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 265 transitions. [2024-11-28 03:20:40,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6264775413711584 [2024-11-28 03:20:40,273 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 82 flow. Second operand 9 states and 265 transitions. [2024-11-28 03:20:40,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 139 transitions, 544 flow [2024-11-28 03:20:40,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 139 transitions, 543 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:20:40,280 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 177 flow [2024-11-28 03:20:40,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=177, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2024-11-28 03:20:40,280 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-11-28 03:20:40,281 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 177 flow [2024-11-28 03:20:40,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:40,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:40,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:40,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:20:40,281 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:20:40,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:40,282 INFO L85 PathProgramCache]: Analyzing trace with hash -598924211, now seen corresponding path program 1 times [2024-11-28 03:20:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:40,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761104913] [2024-11-28 03:20:40,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:40,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:40,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761104913] [2024-11-28 03:20:40,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761104913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:40,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:40,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:20:40,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482438188] [2024-11-28 03:20:40,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:40,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:20:40,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:40,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:20:40,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:20:40,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-11-28 03:20:40,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:40,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:20:40,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-11-28 03:20:40,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:20:42,059 INFO L124 PetriNetUnfolderBase]: 4127/6781 cut-off events. [2024-11-28 03:20:42,060 INFO L125 PetriNetUnfolderBase]: For 8918/8927 co-relation queries the response was YES. [2024-11-28 03:20:42,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19903 conditions, 6781 events. 4127/6781 cut-off events. For 8918/8927 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 45890 event pairs, 647 based on Foata normal form. 232/6992 useless extension candidates. Maximal degree in co-relation 19888. Up to 2655 conditions per place. [2024-11-28 03:20:42,111 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 52 selfloop transitions, 7 changer transitions 72/142 dead transitions. [2024-11-28 03:20:42,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 142 transitions, 877 flow [2024-11-28 03:20:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:20:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 03:20:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 271 transitions. [2024-11-28 03:20:42,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5765957446808511 [2024-11-28 03:20:42,114 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 177 flow. Second operand 10 states and 271 transitions. [2024-11-28 03:20:42,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 142 transitions, 877 flow [2024-11-28 03:20:42,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 142 transitions, 763 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-11-28 03:20:42,179 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 219 flow [2024-11-28 03:20:42,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=219, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2024-11-28 03:20:42,180 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 16 predicate places. [2024-11-28 03:20:42,180 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 219 flow [2024-11-28 03:20:42,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:42,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:42,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:42,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:20:42,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:20:42,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:42,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1180265566, now seen corresponding path program 1 times [2024-11-28 03:20:42,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:42,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715213522] [2024-11-28 03:20:42,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:42,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:42,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:42,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715213522] [2024-11-28 03:20:42,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715213522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:42,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:42,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:20:42,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658325339] [2024-11-28 03:20:42,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:42,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:20:42,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:42,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:20:42,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:20:42,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-11-28 03:20:42,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:42,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:20:42,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-11-28 03:20:42,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:20:43,996 INFO L124 PetriNetUnfolderBase]: 3582/5922 cut-off events. [2024-11-28 03:20:43,996 INFO L125 PetriNetUnfolderBase]: For 11136/11177 co-relation queries the response was YES. [2024-11-28 03:20:44,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17913 conditions, 5922 events. 3582/5922 cut-off events. For 11136/11177 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 38533 event pairs, 534 based on Foata normal form. 161/6052 useless extension candidates. Maximal degree in co-relation 17891. Up to 2621 conditions per place. [2024-11-28 03:20:44,034 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 49 selfloop transitions, 11 changer transitions 60/131 dead transitions. [2024-11-28 03:20:44,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 131 transitions, 839 flow [2024-11-28 03:20:44,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:20:44,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 03:20:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 261 transitions. [2024-11-28 03:20:44,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5553191489361702 [2024-11-28 03:20:44,036 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 219 flow. Second operand 10 states and 261 transitions. [2024-11-28 03:20:44,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 131 transitions, 839 flow [2024-11-28 03:20:44,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 131 transitions, 786 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-11-28 03:20:44,130 INFO L231 Difference]: Finished difference. Result has 75 places, 50 transitions, 311 flow [2024-11-28 03:20:44,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=311, PETRI_PLACES=75, PETRI_TRANSITIONS=50} [2024-11-28 03:20:44,131 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2024-11-28 03:20:44,131 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 50 transitions, 311 flow [2024-11-28 03:20:44,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:44,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:44,132 INFO L206 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] [2024-11-28 03:20:44,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:20:44,132 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:20:44,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:44,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1238204385, now seen corresponding path program 1 times [2024-11-28 03:20:44,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:44,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461396697] [2024-11-28 03:20:44,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:44,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:44,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:44,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461396697] [2024-11-28 03:20:44,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461396697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:44,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:44,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:20:44,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978044241] [2024-11-28 03:20:44,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:44,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:20:44,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:44,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:20:44,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:20:44,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-28 03:20:44,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 50 transitions, 311 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:44,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:20:44,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-28 03:20:44,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:20:45,186 INFO L124 PetriNetUnfolderBase]: 3998/6761 cut-off events. [2024-11-28 03:20:45,186 INFO L125 PetriNetUnfolderBase]: For 7962/8379 co-relation queries the response was YES. [2024-11-28 03:20:45,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17204 conditions, 6761 events. 3998/6761 cut-off events. For 7962/8379 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 44959 event pairs, 708 based on Foata normal form. 393/6963 useless extension candidates. Maximal degree in co-relation 17176. Up to 3422 conditions per place. [2024-11-28 03:20:45,237 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 49 selfloop transitions, 5 changer transitions 0/79 dead transitions. [2024-11-28 03:20:45,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 79 transitions, 537 flow [2024-11-28 03:20:45,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:20:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 03:20:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2024-11-28 03:20:45,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.648936170212766 [2024-11-28 03:20:45,238 INFO L175 Difference]: Start difference. First operand has 75 places, 50 transitions, 311 flow. Second operand 4 states and 122 transitions. [2024-11-28 03:20:45,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 79 transitions, 537 flow [2024-11-28 03:20:45,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 499 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-11-28 03:20:45,288 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 319 flow [2024-11-28 03:20:45,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-11-28 03:20:45,289 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2024-11-28 03:20:45,289 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 319 flow [2024-11-28 03:20:45,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:45,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:45,289 INFO L206 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] [2024-11-28 03:20:45,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:20:45,290 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:20:45,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:45,290 INFO L85 PathProgramCache]: Analyzing trace with hash 992549184, now seen corresponding path program 1 times [2024-11-28 03:20:45,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:45,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732759203] [2024-11-28 03:20:45,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:45,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:45,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:45,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:45,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732759203] [2024-11-28 03:20:45,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732759203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:45,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:45,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:20:45,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172425943] [2024-11-28 03:20:45,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:45,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:20:45,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:45,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:20:45,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:20:45,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-28 03:20:45,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:45,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:20:45,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-28 03:20:45,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:20:46,280 INFO L124 PetriNetUnfolderBase]: 2850/4891 cut-off events. [2024-11-28 03:20:46,280 INFO L125 PetriNetUnfolderBase]: For 4244/4460 co-relation queries the response was YES. [2024-11-28 03:20:46,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13483 conditions, 4891 events. 2850/4891 cut-off events. For 4244/4460 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 30883 event pairs, 471 based on Foata normal form. 273/4989 useless extension candidates. Maximal degree in co-relation 13458. Up to 1554 conditions per place. [2024-11-28 03:20:46,303 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 61 selfloop transitions, 8 changer transitions 0/94 dead transitions. [2024-11-28 03:20:46,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 94 transitions, 614 flow [2024-11-28 03:20:46,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:20:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:20:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-11-28 03:20:46,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-11-28 03:20:46,305 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 319 flow. Second operand 5 states and 155 transitions. [2024-11-28 03:20:46,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 94 transitions, 614 flow [2024-11-28 03:20:46,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 94 transitions, 603 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-11-28 03:20:46,312 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 363 flow [2024-11-28 03:20:46,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=363, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2024-11-28 03:20:46,313 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 16 predicate places. [2024-11-28 03:20:46,313 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 363 flow [2024-11-28 03:20:46,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:46,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:46,313 INFO L206 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] [2024-11-28 03:20:46,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:20:46,313 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:20:46,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:46,314 INFO L85 PathProgramCache]: Analyzing trace with hash 4990620, now seen corresponding path program 1 times [2024-11-28 03:20:46,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:46,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81539293] [2024-11-28 03:20:46,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:46,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:46,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:46,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81539293] [2024-11-28 03:20:46,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81539293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:46,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:46,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:20:46,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830345732] [2024-11-28 03:20:46,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:46,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:20:46,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:46,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:20:46,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:20:46,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-28 03:20:46,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 363 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:46,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:20:46,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-28 03:20:46,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:20:47,576 INFO L124 PetriNetUnfolderBase]: 2322/3931 cut-off events. [2024-11-28 03:20:47,576 INFO L125 PetriNetUnfolderBase]: For 6632/6820 co-relation queries the response was YES. [2024-11-28 03:20:47,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12310 conditions, 3931 events. 2322/3931 cut-off events. For 6632/6820 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 24321 event pairs, 445 based on Foata normal form. 119/3875 useless extension candidates. Maximal degree in co-relation 12286. Up to 1554 conditions per place. [2024-11-28 03:20:47,601 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 53 selfloop transitions, 11 changer transitions 1/90 dead transitions. [2024-11-28 03:20:47,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 90 transitions, 608 flow [2024-11-28 03:20:47,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:20:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:20:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-11-28 03:20:47,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2024-11-28 03:20:47,603 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 363 flow. Second operand 6 states and 170 transitions. [2024-11-28 03:20:47,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 90 transitions, 608 flow [2024-11-28 03:20:47,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 90 transitions, 579 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-28 03:20:47,614 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 379 flow [2024-11-28 03:20:47,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=379, PETRI_PLACES=71, PETRI_TRANSITIONS=59} [2024-11-28 03:20:47,615 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2024-11-28 03:20:47,615 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 379 flow [2024-11-28 03:20:47,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:47,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:47,615 INFO L206 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] [2024-11-28 03:20:47,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:20:47,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:20:47,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:47,617 INFO L85 PathProgramCache]: Analyzing trace with hash 74517375, now seen corresponding path program 1 times [2024-11-28 03:20:47,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:47,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478957830] [2024-11-28 03:20:47,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:47,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:49,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:49,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:49,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478957830] [2024-11-28 03:20:49,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478957830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:49,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:49,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:20:49,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580943541] [2024-11-28 03:20:49,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:49,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:20:49,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:49,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:20:49,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:20:49,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-11-28 03:20:49,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 59 transitions, 379 flow. Second operand has 9 states, 9 states have (on average 21.88888888888889) internal successors, (197), 9 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:49,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:20:49,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-11-28 03:20:49,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:20:50,193 INFO L124 PetriNetUnfolderBase]: 1916/4006 cut-off events. [2024-11-28 03:20:50,194 INFO L125 PetriNetUnfolderBase]: For 6977/7379 co-relation queries the response was YES. [2024-11-28 03:20:50,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11832 conditions, 4006 events. 1916/4006 cut-off events. For 6977/7379 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 32102 event pairs, 571 based on Foata normal form. 72/3651 useless extension candidates. Maximal degree in co-relation 11808. Up to 1140 conditions per place. [2024-11-28 03:20:50,258 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 49 selfloop transitions, 6 changer transitions 19/111 dead transitions. [2024-11-28 03:20:50,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 111 transitions, 715 flow [2024-11-28 03:20:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:20:50,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 03:20:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 230 transitions. [2024-11-28 03:20:50,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6117021276595744 [2024-11-28 03:20:50,260 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 379 flow. Second operand 8 states and 230 transitions. [2024-11-28 03:20:50,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 111 transitions, 715 flow [2024-11-28 03:20:50,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 111 transitions, 659 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-11-28 03:20:50,303 INFO L231 Difference]: Finished difference. Result has 79 places, 64 transitions, 387 flow [2024-11-28 03:20:50,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=387, PETRI_PLACES=79, PETRI_TRANSITIONS=64} [2024-11-28 03:20:50,304 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2024-11-28 03:20:50,305 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 64 transitions, 387 flow [2024-11-28 03:20:50,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.88888888888889) internal successors, (197), 9 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:50,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:50,305 INFO L206 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] [2024-11-28 03:20:50,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:20:50,305 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:20:50,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:50,306 INFO L85 PathProgramCache]: Analyzing trace with hash -690778093, now seen corresponding path program 2 times [2024-11-28 03:20:50,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:50,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195244092] [2024-11-28 03:20:50,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:20:50,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:50,342 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:20:50,342 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:20:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:50,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:50,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195244092] [2024-11-28 03:20:50,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195244092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:50,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:50,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:20:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804271103] [2024-11-28 03:20:50,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:50,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:20:50,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:50,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:20:50,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:20:50,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-11-28 03:20:50,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 64 transitions, 387 flow. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:50,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:20:50,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-11-28 03:20:50,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:20:51,663 INFO L124 PetriNetUnfolderBase]: 3871/7166 cut-off events. [2024-11-28 03:20:51,663 INFO L125 PetriNetUnfolderBase]: For 11505/12465 co-relation queries the response was YES. [2024-11-28 03:20:51,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22279 conditions, 7166 events. 3871/7166 cut-off events. For 11505/12465 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 57181 event pairs, 836 based on Foata normal form. 167/6692 useless extension candidates. Maximal degree in co-relation 22251. Up to 1925 conditions per place. [2024-11-28 03:20:51,697 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 48 selfloop transitions, 12 changer transitions 55/134 dead transitions. [2024-11-28 03:20:51,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 134 transitions, 960 flow [2024-11-28 03:20:51,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:20:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 03:20:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-11-28 03:20:51,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.526595744680851 [2024-11-28 03:20:51,699 INFO L175 Difference]: Start difference. First operand has 79 places, 64 transitions, 387 flow. Second operand 8 states and 198 transitions. [2024-11-28 03:20:51,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 134 transitions, 960 flow [2024-11-28 03:20:51,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 134 transitions, 939 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-28 03:20:51,780 INFO L231 Difference]: Finished difference. Result has 83 places, 58 transitions, 358 flow [2024-11-28 03:20:51,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=358, PETRI_PLACES=83, PETRI_TRANSITIONS=58} [2024-11-28 03:20:51,780 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 31 predicate places. [2024-11-28 03:20:51,781 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 58 transitions, 358 flow [2024-11-28 03:20:51,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:51,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:51,781 INFO L206 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] [2024-11-28 03:20:51,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:20:51,781 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:20:51,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash -938278309, now seen corresponding path program 3 times [2024-11-28 03:20:51,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:51,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114914365] [2024-11-28 03:20:51,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:20:51,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:51,828 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 03:20:51,828 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:20:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:53,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:53,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114914365] [2024-11-28 03:20:53,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114914365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:53,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:53,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:20:53,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214720222] [2024-11-28 03:20:53,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:53,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:20:53,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:53,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:20:53,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:20:53,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-11-28 03:20:53,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 58 transitions, 358 flow. Second operand has 9 states, 9 states have (on average 21.88888888888889) internal successors, (197), 9 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:53,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:20:53,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-11-28 03:20:53,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:20:54,159 INFO L124 PetriNetUnfolderBase]: 2063/4243 cut-off events. [2024-11-28 03:20:54,159 INFO L125 PetriNetUnfolderBase]: For 6370/6979 co-relation queries the response was YES. [2024-11-28 03:20:54,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12543 conditions, 4243 events. 2063/4243 cut-off events. For 6370/6979 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 34497 event pairs, 394 based on Foata normal form. 96/3852 useless extension candidates. Maximal degree in co-relation 12513. Up to 788 conditions per place. [2024-11-28 03:20:54,179 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 56 selfloop transitions, 10 changer transitions 32/131 dead transitions. [2024-11-28 03:20:54,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 131 transitions, 845 flow [2024-11-28 03:20:54,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:20:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-28 03:20:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 333 transitions. [2024-11-28 03:20:54,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904255319148937 [2024-11-28 03:20:54,183 INFO L175 Difference]: Start difference. First operand has 83 places, 58 transitions, 358 flow. Second operand 12 states and 333 transitions. [2024-11-28 03:20:54,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 131 transitions, 845 flow [2024-11-28 03:20:54,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 131 transitions, 815 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-28 03:20:54,240 INFO L231 Difference]: Finished difference. Result has 91 places, 61 transitions, 388 flow [2024-11-28 03:20:54,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=388, PETRI_PLACES=91, PETRI_TRANSITIONS=61} [2024-11-28 03:20:54,241 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 39 predicate places. [2024-11-28 03:20:54,241 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 61 transitions, 388 flow [2024-11-28 03:20:54,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.88888888888889) internal successors, (197), 9 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:54,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:54,241 INFO L206 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] [2024-11-28 03:20:54,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:20:54,241 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:20:54,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:54,245 INFO L85 PathProgramCache]: Analyzing trace with hash 552818909, now seen corresponding path program 4 times [2024-11-28 03:20:54,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:54,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503852852] [2024-11-28 03:20:54,245 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:20:54,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:54,372 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:20:54,372 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-28 03:20:54,372 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:20:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:20:54,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:20:54,496 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:20:54,497 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-28 03:20:54,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-28 03:20:54,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-28 03:20:54,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-28 03:20:54,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-28 03:20:54,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-28 03:20:54,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-28 03:20:54,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:20:54,504 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:54,608 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 03:20:54,608 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:20:54,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:20:54 BasicIcfg [2024-11-28 03:20:54,614 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:20:54,614 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:20:54,614 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:20:54,615 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:20:54,615 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:35" (3/4) ... [2024-11-28 03:20:54,617 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 03:20:54,618 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:20:54,619 INFO L158 Benchmark]: Toolchain (without parser) took 20608.48ms. Allocated memory was 117.4MB in the beginning and 880.8MB in the end (delta: 763.4MB). Free memory was 91.3MB in the beginning and 425.3MB in the end (delta: -334.0MB). Peak memory consumption was 430.2MB. Max. memory is 16.1GB. [2024-11-28 03:20:54,619 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:20:54,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 643.67ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 67.8MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 03:20:54,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.55ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:20:54,620 INFO L158 Benchmark]: Boogie Preprocessor took 55.82ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 62.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:20:54,620 INFO L158 Benchmark]: RCFGBuilder took 947.82ms. Allocated memory is still 117.4MB. Free memory was 62.3MB in the beginning and 64.9MB in the end (delta: -2.6MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-28 03:20:54,620 INFO L158 Benchmark]: TraceAbstraction took 18907.40ms. Allocated memory was 117.4MB in the beginning and 880.8MB in the end (delta: 763.4MB). Free memory was 64.4MB in the beginning and 425.4MB in the end (delta: -361.1MB). Peak memory consumption was 399.7MB. Max. memory is 16.1GB. [2024-11-28 03:20:54,621 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 880.8MB. Free memory was 425.4MB in the beginning and 425.3MB in the end (delta: 121.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:20:54,624 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.72ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 643.67ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 67.8MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.55ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.82ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 62.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 947.82ms. Allocated memory is still 117.4MB. Free memory was 62.3MB in the beginning and 64.9MB in the end (delta: -2.6MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18907.40ms. Allocated memory was 117.4MB in the beginning and 880.8MB in the end (delta: 763.4MB). Free memory was 64.4MB in the beginning and 425.4MB in the end (delta: -361.1MB). Peak memory consumption was 399.7MB. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 880.8MB. Free memory was 425.4MB in the beginning and 425.3MB in the end (delta: 121.4kB). There was no memory consumed. Max. memory is 16.1GB. * 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [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$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t281; [L849] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, t281=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t282; [L851] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, t281=-2, t282=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t283; [L853] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, t281=-2, t282=-1, t283=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L778] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L781] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L784] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L787] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L804] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1] [L807] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, weak$$choice2=0, x=2, y=1, z=1] [L826] 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) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 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 [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, weak$$choice2=0, x=2, y=1, z=1] [L764] 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) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 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 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L790] 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) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 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 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t281=-2, t282=-1, t283=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 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 [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t281=-2, t282=-1, t283=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t281=-2, t282=-1, t283=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix011_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, 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: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 851]: 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 7 procedures, 74 locations, 7 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: 18.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 605 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 573 mSDsluCounter, 232 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 175 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1871 IncrementalHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 57 mSDtfsCounter, 1871 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred in iteration=11, InterpolantAutomatonStates: 78, 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.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 2011 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 03:20:54,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB --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 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:20:57,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:20:57,591 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-28 03:20:57,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:20:57,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:20:57,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:20:57,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:20:57,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:20:57,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:20:57,627 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:20:57,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:20:57,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:20:57,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:20:57,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:20:57,628 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:20:57,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:20:57,629 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:20:57,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:20:57,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:20:57,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:20:57,629 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:20:57,629 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:20:57,630 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:20:57,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:20:57,630 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:20:57,630 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 03:20:57,630 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 03:20:57,630 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:20:57,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:20:57,631 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:20:57,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:20:57,631 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:20:57,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:20:57,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:20:57,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:20:57,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:20:57,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:20:57,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:20:57,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:20:57,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:20:57,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:20:57,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:20:57,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:20:57,633 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 03:20:57,633 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 03:20:57,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:20:57,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:20:57,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:20:57,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:20:57,634 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b [2024-11-28 03:20:57,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:20:57,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:20:57,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:20:57,963 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:20:57,964 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:20:57,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2024-11-28 03:21:01,044 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/data/366887781/682cf2fd4949404e8b85bebca9cecacf/FLAG5c853513a [2024-11-28 03:21:01,400 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:21:01,401 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2024-11-28 03:21:01,420 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/data/366887781/682cf2fd4949404e8b85bebca9cecacf/FLAG5c853513a [2024-11-28 03:21:01,611 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/data/366887781/682cf2fd4949404e8b85bebca9cecacf [2024-11-28 03:21:01,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:21:01,615 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:21:01,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:21:01,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:21:01,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:21:01,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:21:01" (1/1) ... [2024-11-28 03:21:01,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a5b0454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:01, skipping insertion in model container [2024-11-28 03:21:01,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:21:01" (1/1) ... [2024-11-28 03:21:01,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:21:01,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:21:02,012 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:21:02,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:21:02,178 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:21:02,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:02 WrapperNode [2024-11-28 03:21:02,179 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:21:02,180 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:21:02,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:21:02,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:21:02,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:02" (1/1) ... [2024-11-28 03:21:02,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:02" (1/1) ... [2024-11-28 03:21:02,236 INFO L138 Inliner]: procedures = 176, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 123 [2024-11-28 03:21:02,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:21:02,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:21:02,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:21:02,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:21:02,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:02" (1/1) ... [2024-11-28 03:21:02,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:02" (1/1) ... [2024-11-28 03:21:02,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:02" (1/1) ... [2024-11-28 03:21:02,268 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-28 03:21:02,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:02" (1/1) ... [2024-11-28 03:21:02,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:02" (1/1) ... [2024-11-28 03:21:02,278 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:02" (1/1) ... [2024-11-28 03:21:02,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:02" (1/1) ... [2024-11-28 03:21:02,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:02" (1/1) ... [2024-11-28 03:21:02,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:02" (1/1) ... [2024-11-28 03:21:02,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:02" (1/1) ... [2024-11-28 03:21:02,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:21:02,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:21:02,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:21:02,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:21:02,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:02" (1/1) ... [2024-11-28 03:21:02,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:21:02,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:02,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:21:02,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:21:02,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 03:21:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:21:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 03:21:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-28 03:21:02,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-28 03:21:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-28 03:21:02,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-28 03:21:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-28 03:21:02,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-28 03:21:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 03:21:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:21:02,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:21:02,353 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:21:02,517 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:21:02,520 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:21:02,908 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:21:02,908 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:21:03,282 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:21:03,282 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 03:21:03,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:21:03 BoogieIcfgContainer [2024-11-28 03:21:03,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:21:03,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:21:03,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:21:03,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:21:03,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:21:01" (1/3) ... [2024-11-28 03:21:03,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295f64e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:21:03, skipping insertion in model container [2024-11-28 03:21:03,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:02" (2/3) ... [2024-11-28 03:21:03,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295f64e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:21:03, skipping insertion in model container [2024-11-28 03:21:03,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:21:03" (3/3) ... [2024-11-28 03:21:03,299 INFO L128 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i [2024-11-28 03:21:03,319 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:21:03,321 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i that has 4 procedures, 46 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-28 03:21:03,321 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:21:03,424 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 03:21:03,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2024-11-28 03:21:03,540 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-11-28 03:21:03,543 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:21:03,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-11-28 03:21:03,550 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2024-11-28 03:21:03,557 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2024-11-28 03:21:03,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:21:03,586 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@602d6101, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:21:03,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-28 03:21:03,595 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:21:03,595 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-28 03:21:03,595 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:21:03,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:03,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-28 03:21:03,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:21:03,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:03,603 INFO L85 PathProgramCache]: Analyzing trace with hash 12431965, now seen corresponding path program 1 times [2024-11-28 03:21:03,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:21:03,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1771955560] [2024-11-28 03:21:03,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:03,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:03,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:03,622 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:21:03,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:21:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:03,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:21:03,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:21:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:03,797 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:21:03,798 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:21:03,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771955560] [2024-11-28 03:21:03,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771955560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:03,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:03,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 03:21:03,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359843658] [2024-11-28 03:21:03,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:03,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:21:03,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:21:03,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:21:03,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:21:03,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-11-28 03:21:03,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:03,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:03,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-11-28 03:21:03,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:04,538 INFO L124 PetriNetUnfolderBase]: 825/1532 cut-off events. [2024-11-28 03:21:04,539 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-28 03:21:04,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2813 conditions, 1532 events. 825/1532 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10238 event pairs, 129 based on Foata normal form. 96/1605 useless extension candidates. Maximal degree in co-relation 2802. Up to 1009 conditions per place. [2024-11-28 03:21:04,562 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 33 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-11-28 03:21:04,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 201 flow [2024-11-28 03:21:04,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:21:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:21:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-11-28 03:21:04,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7659574468085106 [2024-11-28 03:21:04,584 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 108 transitions. [2024-11-28 03:21:04,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 201 flow [2024-11-28 03:21:04,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 196 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 03:21:04,598 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2024-11-28 03:21:04,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-28 03:21:04,606 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-11-28 03:21:04,609 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2024-11-28 03:21:04,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:04,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:04,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:04,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 03:21:04,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:04,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:21:04,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1460712733, now seen corresponding path program 1 times [2024-11-28 03:21:04,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:21:04,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [935919218] [2024-11-28 03:21:04,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:04,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:04,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:04,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:21:04,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:21:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:04,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 03:21:04,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:21:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:04,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:21:04,974 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:21:04,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935919218] [2024-11-28 03:21:04,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935919218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:04,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:04,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 03:21:04,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674524625] [2024-11-28 03:21:04,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:04,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:21:04,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:21:04,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:21:04,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:21:04,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-11-28 03:21:04,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:04,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:04,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-11-28 03:21:04,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:05,353 INFO L124 PetriNetUnfolderBase]: 721/1393 cut-off events. [2024-11-28 03:21:05,353 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-28 03:21:05,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2613 conditions, 1393 events. 721/1393 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9247 event pairs, 721 based on Foata normal form. 48/1382 useless extension candidates. Maximal degree in co-relation 2603. Up to 1090 conditions per place. [2024-11-28 03:21:05,370 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 18 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2024-11-28 03:21:05,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 126 flow [2024-11-28 03:21:05,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:21:05,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:21:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-11-28 03:21:05,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-11-28 03:21:05,374 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 84 transitions. [2024-11-28 03:21:05,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 126 flow [2024-11-28 03:21:05,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:21:05,378 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 82 flow [2024-11-28 03:21:05,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-28 03:21:05,379 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2024-11-28 03:21:05,380 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 82 flow [2024-11-28 03:21:05,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:05,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:05,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:05,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 03:21:05,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:05,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:21:05,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:05,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1460714160, now seen corresponding path program 1 times [2024-11-28 03:21:05,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:21:05,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [86420351] [2024-11-28 03:21:05,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:05,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:05,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:05,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:21:05,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:21:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:05,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 03:21:05,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:21:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:05,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:21:05,773 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:21:05,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86420351] [2024-11-28 03:21:05,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86420351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:05,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:05,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:21:05,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366735052] [2024-11-28 03:21:05,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:05,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:21:05,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:21:05,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:21:05,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:21:05,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-28 03:21:05,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:05,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:05,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-28 03:21:05,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:06,377 INFO L124 PetriNetUnfolderBase]: 1499/2623 cut-off events. [2024-11-28 03:21:06,377 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:21:06,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4939 conditions, 2623 events. 1499/2623 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 16841 event pairs, 188 based on Foata normal form. 100/2677 useless extension candidates. Maximal degree in co-relation 4933. Up to 1316 conditions per place. [2024-11-28 03:21:06,399 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 42 selfloop transitions, 5 changer transitions 1/62 dead transitions. [2024-11-28 03:21:06,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 232 flow [2024-11-28 03:21:06,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:21:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 03:21:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2024-11-28 03:21:06,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.648936170212766 [2024-11-28 03:21:06,402 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 82 flow. Second operand 4 states and 122 transitions. [2024-11-28 03:21:06,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 232 flow [2024-11-28 03:21:06,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:21:06,404 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 115 flow [2024-11-28 03:21:06,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-11-28 03:21:06,405 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2024-11-28 03:21:06,405 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 115 flow [2024-11-28 03:21:06,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:06,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:06,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:06,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 03:21:06,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:06,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:21:06,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:06,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1402193371, now seen corresponding path program 1 times [2024-11-28 03:21:06,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:21:06,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152381376] [2024-11-28 03:21:06,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:06,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:06,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:06,613 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:21:06,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:21:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:06,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:21:06,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:21:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:06,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:21:06,778 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:21:06,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152381376] [2024-11-28 03:21:06,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152381376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:06,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:06,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:21:06,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574397545] [2024-11-28 03:21:06,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:06,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:21:06,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:21:06,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:21:06,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:21:06,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-28 03:21:06,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:06,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:06,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-28 03:21:06,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:07,240 INFO L124 PetriNetUnfolderBase]: 962/1690 cut-off events. [2024-11-28 03:21:07,240 INFO L125 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2024-11-28 03:21:07,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3796 conditions, 1690 events. 962/1690 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9426 event pairs, 100 based on Foata normal form. 82/1736 useless extension candidates. Maximal degree in co-relation 3787. Up to 581 conditions per place. [2024-11-28 03:21:07,251 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 53 selfloop transitions, 8 changer transitions 1/76 dead transitions. [2024-11-28 03:21:07,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 332 flow [2024-11-28 03:21:07,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:21:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:21:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-11-28 03:21:07,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6553191489361702 [2024-11-28 03:21:07,253 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 115 flow. Second operand 5 states and 154 transitions. [2024-11-28 03:21:07,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 332 flow [2024-11-28 03:21:07,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 76 transitions, 322 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-28 03:21:07,258 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 155 flow [2024-11-28 03:21:07,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2024-11-28 03:21:07,260 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2024-11-28 03:21:07,261 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 155 flow [2024-11-28 03:21:07,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:07,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:07,261 INFO L206 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] [2024-11-28 03:21:07,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:21:07,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:07,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:21:07,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:07,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1907871940, now seen corresponding path program 1 times [2024-11-28 03:21:07,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:21:07,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [561147353] [2024-11-28 03:21:07,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:07,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:07,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:07,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:21:07,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:21:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:07,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:21:07,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:21:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:07,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:21:07,646 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:21:07,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561147353] [2024-11-28 03:21:07,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561147353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:07,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:07,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:21:07,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017528944] [2024-11-28 03:21:07,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:07,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:21:07,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:21:07,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:21:07,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:21:07,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-28 03:21:07,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:07,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:07,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-28 03:21:07,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:08,021 INFO L124 PetriNetUnfolderBase]: 569/967 cut-off events. [2024-11-28 03:21:08,021 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2024-11-28 03:21:08,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2482 conditions, 967 events. 569/967 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4445 event pairs, 83 based on Foata normal form. 40/972 useless extension candidates. Maximal degree in co-relation 2471. Up to 308 conditions per place. [2024-11-28 03:21:08,027 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 46 selfloop transitions, 11 changer transitions 1/72 dead transitions. [2024-11-28 03:21:08,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 339 flow [2024-11-28 03:21:08,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:21:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:21:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-11-28 03:21:08,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-11-28 03:21:08,029 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 155 flow. Second operand 6 states and 168 transitions. [2024-11-28 03:21:08,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 339 flow [2024-11-28 03:21:08,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 314 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-28 03:21:08,036 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 169 flow [2024-11-28 03:21:08,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2024-11-28 03:21:08,036 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2024-11-28 03:21:08,037 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 169 flow [2024-11-28 03:21:08,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:08,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:08,037 INFO L206 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] [2024-11-28 03:21:08,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 03:21:08,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:08,241 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:21:08,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:08,242 INFO L85 PathProgramCache]: Analyzing trace with hash -716109951, now seen corresponding path program 1 times [2024-11-28 03:21:08,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:21:08,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059357785] [2024-11-28 03:21:08,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:08,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:08,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:08,247 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:21:08,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:21:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:08,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 03:21:08,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:21:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:08,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:21:08,960 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:21:08,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059357785] [2024-11-28 03:21:08,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059357785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:08,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:08,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:21:08,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234859387] [2024-11-28 03:21:08,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:08,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:21:08,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:21:08,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:21:08,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:21:08,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-11-28 03:21:08,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 169 flow. Second operand has 10 states, 10 states have (on average 21.8) internal successors, (218), 10 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:08,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:08,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-11-28 03:21:08,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:09,588 INFO L124 PetriNetUnfolderBase]: 479/904 cut-off events. [2024-11-28 03:21:09,588 INFO L125 PetriNetUnfolderBase]: For 514/530 co-relation queries the response was YES. [2024-11-28 03:21:09,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2191 conditions, 904 events. 479/904 cut-off events. For 514/530 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4502 event pairs, 110 based on Foata normal form. 8/867 useless extension candidates. Maximal degree in co-relation 2179. Up to 256 conditions per place. [2024-11-28 03:21:09,594 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 33 selfloop transitions, 4 changer transitions 28/87 dead transitions. [2024-11-28 03:21:09,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 407 flow [2024-11-28 03:21:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:21:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 03:21:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 266 transitions. [2024-11-28 03:21:09,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5659574468085107 [2024-11-28 03:21:09,596 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 169 flow. Second operand 10 states and 266 transitions. [2024-11-28 03:21:09,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 407 flow [2024-11-28 03:21:09,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 340 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-28 03:21:09,602 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 133 flow [2024-11-28 03:21:09,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=133, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2024-11-28 03:21:09,603 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2024-11-28 03:21:09,603 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 133 flow [2024-11-28 03:21:09,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.8) internal successors, (218), 10 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:09,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:09,604 INFO L206 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] [2024-11-28 03:21:09,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:21:09,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:09,808 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:21:09,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:09,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2078753373, now seen corresponding path program 2 times [2024-11-28 03:21:09,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:21:09,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1674590850] [2024-11-28 03:21:09,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:21:09,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:09,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:09,811 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:21:09,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:21:09,916 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:21:09,916 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:21:09,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 03:21:09,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:21:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:10,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:21:10,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:21:10,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674590850] [2024-11-28 03:21:10,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674590850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:10,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:10,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:21:10,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469494273] [2024-11-28 03:21:10,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:10,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:21:10,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:21:10,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:21:10,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:21:10,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-11-28 03:21:10,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 133 flow. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:10,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:10,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-11-28 03:21:10,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:10,835 INFO L124 PetriNetUnfolderBase]: 1117/1848 cut-off events. [2024-11-28 03:21:10,836 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2024-11-28 03:21:10,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4357 conditions, 1848 events. 1117/1848 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9258 event pairs, 244 based on Foata normal form. 8/1839 useless extension candidates. Maximal degree in co-relation 4344. Up to 887 conditions per place. [2024-11-28 03:21:10,844 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 40 selfloop transitions, 6 changer transitions 43/100 dead transitions. [2024-11-28 03:21:10,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 100 transitions, 487 flow [2024-11-28 03:21:10,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:21:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 03:21:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2024-11-28 03:21:10,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2024-11-28 03:21:10,845 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 133 flow. Second operand 9 states and 219 transitions. [2024-11-28 03:21:10,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 100 transitions, 487 flow [2024-11-28 03:21:10,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 447 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-11-28 03:21:10,849 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 154 flow [2024-11-28 03:21:10,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=154, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2024-11-28 03:21:10,850 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2024-11-28 03:21:10,850 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 154 flow [2024-11-28 03:21:10,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:10,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:10,851 INFO L206 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] [2024-11-28 03:21:10,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 03:21:11,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:11,055 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:21:11,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:11,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1658252665, now seen corresponding path program 3 times [2024-11-28 03:21:11,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:21:11,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [100939918] [2024-11-28 03:21:11,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:21:11,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:11,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:11,059 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:21:11,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:21:11,156 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 03:21:11,156 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:21:11,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 03:21:11,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:21:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:11,234 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:21:11,234 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:21:11,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100939918] [2024-11-28 03:21:11,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100939918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:11,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:11,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:21:11,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432337729] [2024-11-28 03:21:11,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:11,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:21:11,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:21:11,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:21:11,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:21:11,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-28 03:21:11,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:11,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:11,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-28 03:21:11,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:11,670 INFO L124 PetriNetUnfolderBase]: 819/1534 cut-off events. [2024-11-28 03:21:11,670 INFO L125 PetriNetUnfolderBase]: For 212/220 co-relation queries the response was YES. [2024-11-28 03:21:11,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3325 conditions, 1534 events. 819/1534 cut-off events. For 212/220 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8766 event pairs, 364 based on Foata normal form. 8/1415 useless extension candidates. Maximal degree in co-relation 3310. Up to 705 conditions per place. [2024-11-28 03:21:11,678 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 31 selfloop transitions, 2 changer transitions 17/72 dead transitions. [2024-11-28 03:21:11,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 323 flow [2024-11-28 03:21:11,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:21:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:21:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-11-28 03:21:11,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5638297872340425 [2024-11-28 03:21:11,679 INFO L175 Difference]: Start difference. First operand has 64 places, 45 transitions, 154 flow. Second operand 6 states and 159 transitions. [2024-11-28 03:21:11,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 323 flow [2024-11-28 03:21:11,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 299 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-11-28 03:21:11,683 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 150 flow [2024-11-28 03:21:11,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2024-11-28 03:21:11,684 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places. [2024-11-28 03:21:11,684 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 150 flow [2024-11-28 03:21:11,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:11,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:11,684 INFO L206 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] [2024-11-28 03:21:11,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 03:21:11,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:11,889 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:21:11,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:11,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1077781317, now seen corresponding path program 4 times [2024-11-28 03:21:11,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:21:11,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1539244098] [2024-11-28 03:21:11,891 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:21:11,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:11,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:11,893 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:21:11,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:21:11,979 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:21:11,979 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:21:11,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 03:21:11,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:21:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:12,073 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:21:12,073 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:21:12,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539244098] [2024-11-28 03:21:12,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539244098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:12,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:12,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:21:12,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705505740] [2024-11-28 03:21:12,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:12,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:21:12,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:21:12,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:21:12,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:21:12,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-28 03:21:12,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 150 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 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) [2024-11-28 03:21:12,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:12,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-28 03:21:12,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:12,485 INFO L124 PetriNetUnfolderBase]: 511/1008 cut-off events. [2024-11-28 03:21:12,485 INFO L125 PetriNetUnfolderBase]: For 209/212 co-relation queries the response was YES. [2024-11-28 03:21:12,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2193 conditions, 1008 events. 511/1008 cut-off events. For 209/212 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5012 event pairs, 182 based on Foata normal form. 10/976 useless extension candidates. Maximal degree in co-relation 2179. Up to 433 conditions per place. [2024-11-28 03:21:12,491 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 25 selfloop transitions, 2 changer transitions 25/73 dead transitions. [2024-11-28 03:21:12,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 322 flow [2024-11-28 03:21:12,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:21:12,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 03:21:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-11-28 03:21:12,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.541033434650456 [2024-11-28 03:21:12,493 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 150 flow. Second operand 7 states and 178 transitions. [2024-11-28 03:21:12,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 322 flow [2024-11-28 03:21:12,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 304 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-28 03:21:12,499 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 154 flow [2024-11-28 03:21:12,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2024-11-28 03:21:12,500 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2024-11-28 03:21:12,501 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 154 flow [2024-11-28 03:21:12,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 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) [2024-11-28 03:21:12,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:12,502 INFO L206 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] [2024-11-28 03:21:12,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 03:21:12,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:12,702 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-28 03:21:12,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:12,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2057036975, now seen corresponding path program 5 times [2024-11-28 03:21:12,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:21:12,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1295712140] [2024-11-28 03:21:12,704 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 03:21:12,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:12,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:12,710 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:21:12,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 03:21:12,810 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:21:12,810 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-28 03:21:12,810 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:21:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:21:12,914 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-28 03:21:12,915 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:21:12,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-28 03:21:12,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-28 03:21:12,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-28 03:21:12,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-28 03:21:12,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-28 03:21:12,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-28 03:21:12,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-28 03:21:12,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 03:21:13,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:21:13,119 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-28 03:21:13,227 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 03:21:13,231 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:21:13,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:21:13 BasicIcfg [2024-11-28 03:21:13,241 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:21:13,242 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:21:13,242 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:21:13,242 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:21:13,243 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:21:03" (3/4) ... [2024-11-28 03:21:13,245 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 03:21:13,245 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:21:13,246 INFO L158 Benchmark]: Toolchain (without parser) took 11631.90ms. Allocated memory was 83.9MB in the beginning and 192.9MB in the end (delta: 109.1MB). Free memory was 59.1MB in the beginning and 88.2MB in the end (delta: -29.1MB). Peak memory consumption was 76.8MB. Max. memory is 16.1GB. [2024-11-28 03:21:13,247 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 83.9MB. Free memory was 63.9MB in the beginning and 63.8MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:21:13,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.05ms. Allocated memory is still 83.9MB. Free memory was 58.8MB in the beginning and 35.4MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 03:21:13,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.84ms. Allocated memory is still 83.9MB. Free memory was 35.4MB in the beginning and 32.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:21:13,249 INFO L158 Benchmark]: Boogie Preprocessor took 50.93ms. Allocated memory is still 83.9MB. Free memory was 32.9MB in the beginning and 29.3MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:21:13,249 INFO L158 Benchmark]: RCFGBuilder took 995.66ms. Allocated memory is still 83.9MB. Free memory was 29.3MB in the beginning and 31.3MB in the end (delta: -2.0MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-11-28 03:21:13,250 INFO L158 Benchmark]: TraceAbstraction took 9954.41ms. Allocated memory was 83.9MB in the beginning and 192.9MB in the end (delta: 109.1MB). Free memory was 30.8MB in the beginning and 88.2MB in the end (delta: -57.4MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2024-11-28 03:21:13,251 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 192.9MB. Free memory was 88.2MB in the beginning and 88.2MB in the end (delta: 15.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:21:13,252 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.57ms. Allocated memory is still 83.9MB. Free memory was 63.9MB in the beginning and 63.8MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.05ms. Allocated memory is still 83.9MB. Free memory was 58.8MB in the beginning and 35.4MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.84ms. Allocated memory is still 83.9MB. Free memory was 35.4MB in the beginning and 32.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.93ms. Allocated memory is still 83.9MB. Free memory was 32.9MB in the beginning and 29.3MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 995.66ms. Allocated memory is still 83.9MB. Free memory was 29.3MB in the beginning and 31.3MB in the end (delta: -2.0MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9954.41ms. Allocated memory was 83.9MB in the beginning and 192.9MB in the end (delta: 109.1MB). Free memory was 30.8MB in the beginning and 88.2MB in the end (delta: -57.4MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 192.9MB. Free memory was 88.2MB in the beginning and 88.2MB in the end (delta: 15.3kB). There was no memory consumed. Max. memory is 16.1GB. * 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [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$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t281; [L849] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, t281=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L850] 0 pthread_t t282; [L851] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, main$tmp_guard0=0, main$tmp_guard1=0, t281=-2, t282=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L852] 0 pthread_t t283; [L853] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, t281=-2, t282=-1, t283=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L790] 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) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 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 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L804] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1] [L807] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, x=2, y=1, z=1] [L764] 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) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 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 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L826] 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) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 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 [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t281=-2, t282=-1, t283=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 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 [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t281=-2, t282=-1, t283=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t281=-2, t282=-1, t283=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix011_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, 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: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 851]: 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 7 procedures, 74 locations, 7 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: 9.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 410 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 388 mSDsluCounter, 197 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 194 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1518 IncrementalHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 3 mSDtfsCounter, 1518 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=5, InterpolantAutomatonStates: 53, 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.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 245 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 823 SizeOfPredicates, 29 NumberOfNonLiveVariables, 949 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 03:21:13,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_325d7645-a577-40ea-901f-6203d57b0a2c/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample