./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI --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 fdecd751bbf3d5ef761eacebee2616261a6cad4ae3645147e0ad096bd1775198 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 22:03:24,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 22:03:24,620 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 22:03:24,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 22:03:24,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 22:03:24,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 22:03:24,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 22:03:24,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 22:03:24,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 22:03:24,665 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 22:03:24,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 22:03:24,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 22:03:24,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 22:03:24,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 22:03:24,668 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 22:03:24,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 22:03:24,669 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 22:03:24,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 22:03:24,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 22:03:24,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 22:03:24,671 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 22:03:24,672 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 22:03:24,673 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 22:03:24,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 22:03:24,674 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 22:03:24,674 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 22:03:24,674 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 22:03:24,675 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 22:03:24,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 22:03:24,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 22:03:24,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 22:03:24,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 22:03:24,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:03:24,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 22:03:24,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 22:03:24,678 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 22:03:24,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 22:03:24,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 22:03:24,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 22:03:24,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 22:03:24,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 22:03:24,681 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI 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 -> fdecd751bbf3d5ef761eacebee2616261a6cad4ae3645147e0ad096bd1775198 [2023-11-24 22:03:24,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 22:03:25,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 22:03:25,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 22:03:25,006 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 22:03:25,008 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 22:03:25,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-24 22:03:28,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 22:03:28,504 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 22:03:28,504 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-24 22:03:28,527 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/data/651d9ee27/cf5aa3eae8f24e9b967a578774cc1100/FLAGbc801765c [2023-11-24 22:03:28,556 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/data/651d9ee27/cf5aa3eae8f24e9b967a578774cc1100 [2023-11-24 22:03:28,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 22:03:28,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 22:03:28,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 22:03:28,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 22:03:28,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 22:03:28,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:03:28" (1/1) ... [2023-11-24 22:03:28,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52401d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:28, skipping insertion in model container [2023-11-24 22:03:28,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:03:28" (1/1) ... [2023-11-24 22:03:28,631 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 22:03:29,140 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:03:29,154 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 22:03:29,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:03:29,261 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:03:29,261 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:03:29,270 INFO L206 MainTranslator]: Completed translation [2023-11-24 22:03:29,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:29 WrapperNode [2023-11-24 22:03:29,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 22:03:29,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 22:03:29,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 22:03:29,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 22:03:29,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:29" (1/1) ... [2023-11-24 22:03:29,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:29" (1/1) ... [2023-11-24 22:03:29,335 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 118 [2023-11-24 22:03:29,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 22:03:29,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 22:03:29,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 22:03:29,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 22:03:29,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:29" (1/1) ... [2023-11-24 22:03:29,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:29" (1/1) ... [2023-11-24 22:03:29,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:29" (1/1) ... [2023-11-24 22:03:29,423 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-24 22:03:29,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:29" (1/1) ... [2023-11-24 22:03:29,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:29" (1/1) ... [2023-11-24 22:03:29,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:29" (1/1) ... [2023-11-24 22:03:29,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:29" (1/1) ... [2023-11-24 22:03:29,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:29" (1/1) ... [2023-11-24 22:03:29,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:29" (1/1) ... [2023-11-24 22:03:29,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 22:03:29,466 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 22:03:29,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 22:03:29,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 22:03:29,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:29" (1/1) ... [2023-11-24 22:03:29,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:03:29,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:03:29,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 22:03:29,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 22:03:29,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 22:03:29,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 22:03:29,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 22:03:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 22:03:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 22:03:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 22:03:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 22:03:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 22:03:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 22:03:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 22:03:29,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 22:03:29,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 22:03:29,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 22:03:29,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 22:03:29,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 22:03:29,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 22:03:29,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 22:03:29,624 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 22:03:29,870 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 22:03:29,877 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 22:03:30,253 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 22:03:30,602 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 22:03:30,602 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 22:03:30,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:30 BoogieIcfgContainer [2023-11-24 22:03:30,603 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 22:03:30,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 22:03:30,611 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 22:03:30,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 22:03:30,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:03:28" (1/3) ... [2023-11-24 22:03:30,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66efd85d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:03:30, skipping insertion in model container [2023-11-24 22:03:30,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:29" (2/3) ... [2023-11-24 22:03:30,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66efd85d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:03:30, skipping insertion in model container [2023-11-24 22:03:30,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:30" (3/3) ... [2023-11-24 22:03:30,624 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-24 22:03:30,646 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 22:03:30,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 22:03:30,646 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 22:03:30,712 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 22:03:30,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 90 flow [2023-11-24 22:03:30,793 INFO L124 PetriNetUnfolderBase]: 2/39 cut-off events. [2023-11-24 22:03:30,793 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:03:30,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 39 events. 2/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2023-11-24 22:03:30,798 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 41 transitions, 90 flow [2023-11-24 22:03:30,802 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 39 transitions, 84 flow [2023-11-24 22:03:30,814 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 22:03:30,822 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@371fbdcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 22:03:30,823 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-24 22:03:30,828 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 22:03:30,828 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 22:03:30,828 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:03:30,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:30,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:03:30,830 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:30,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:30,837 INFO L85 PathProgramCache]: Analyzing trace with hash 11397, now seen corresponding path program 1 times [2023-11-24 22:03:30,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:30,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100712251] [2023-11-24 22:03:30,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:30,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:31,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:31,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100712251] [2023-11-24 22:03:31,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100712251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:31,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:31,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:03:31,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974721751] [2023-11-24 22:03:31,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:31,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:31,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:31,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:31,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:31,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2023-11-24 22:03:31,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:31,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:31,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2023-11-24 22:03:31,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:31,621 INFO L124 PetriNetUnfolderBase]: 237/553 cut-off events. [2023-11-24 22:03:31,622 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-24 22:03:31,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 553 events. 237/553 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3154 event pairs, 175 based on Foata normal form. 40/532 useless extension candidates. Maximal degree in co-relation 965. Up to 307 conditions per place. [2023-11-24 22:03:31,636 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 24 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-24 22:03:31,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 142 flow [2023-11-24 22:03:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2023-11-24 22:03:31,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6747967479674797 [2023-11-24 22:03:31,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 83 transitions. [2023-11-24 22:03:31,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 83 transitions. [2023-11-24 22:03:31,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:31,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 83 transitions. [2023-11-24 22:03:31,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:31,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:31,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:31,675 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 84 flow. Second operand 3 states and 83 transitions. [2023-11-24 22:03:31,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 142 flow [2023-11-24 22:03:31,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:31,684 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-24 22:03:31,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-24 22:03:31,694 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2023-11-24 22:03:31,694 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-24 22:03:31,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:31,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:31,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:03:31,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 22:03:31,696 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:31,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:31,698 INFO L85 PathProgramCache]: Analyzing trace with hash 11398, now seen corresponding path program 1 times [2023-11-24 22:03:31,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:31,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628342465] [2023-11-24 22:03:31,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:31,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:31,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:31,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:31,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628342465] [2023-11-24 22:03:31,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628342465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:31,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:31,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:03:31,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738163623] [2023-11-24 22:03:31,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:31,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:31,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:31,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:31,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:31,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 41 [2023-11-24 22:03:31,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:31,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:31,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 41 [2023-11-24 22:03:31,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:32,100 INFO L124 PetriNetUnfolderBase]: 237/552 cut-off events. [2023-11-24 22:03:32,100 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 22:03:32,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 552 events. 237/552 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3111 event pairs, 175 based on Foata normal form. 1/492 useless extension candidates. Maximal degree in co-relation 985. Up to 306 conditions per place. [2023-11-24 22:03:32,106 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 23 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-24 22:03:32,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 140 flow [2023-11-24 22:03:32,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2023-11-24 22:03:32,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6747967479674797 [2023-11-24 22:03:32,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 83 transitions. [2023-11-24 22:03:32,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 83 transitions. [2023-11-24 22:03:32,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:32,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 83 transitions. [2023-11-24 22:03:32,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,112 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,113 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 83 transitions. [2023-11-24 22:03:32,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 140 flow [2023-11-24 22:03:32,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:32,116 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-24 22:03:32,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-11-24 22:03:32,117 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-24 22:03:32,118 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-24 22:03:32,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:32,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:03:32,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 22:03:32,119 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:32,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash 339844282, now seen corresponding path program 1 times [2023-11-24 22:03:32,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:32,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566082224] [2023-11-24 22:03:32,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:32,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:32,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:32,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566082224] [2023-11-24 22:03:32,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566082224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:32,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:32,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:03:32,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136761683] [2023-11-24 22:03:32,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:32,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:32,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:32,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:32,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:32,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2023-11-24 22:03:32,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:32,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2023-11-24 22:03:32,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:32,413 INFO L124 PetriNetUnfolderBase]: 183/393 cut-off events. [2023-11-24 22:03:32,413 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-24 22:03:32,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 393 events. 183/393 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1905 event pairs, 69 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 732. Up to 265 conditions per place. [2023-11-24 22:03:32,417 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 25 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-11-24 22:03:32,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 160 flow [2023-11-24 22:03:32,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-24 22:03:32,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7317073170731707 [2023-11-24 22:03:32,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-24 22:03:32,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-24 22:03:32,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:32,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-24 22:03:32,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,423 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 90 transitions. [2023-11-24 22:03:32,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 160 flow [2023-11-24 22:03:32,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:32,425 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 72 flow [2023-11-24 22:03:32,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-11-24 22:03:32,427 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2023-11-24 22:03:32,427 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 72 flow [2023-11-24 22:03:32,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:32,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:03:32,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 22:03:32,428 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:32,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:32,429 INFO L85 PathProgramCache]: Analyzing trace with hash 339843573, now seen corresponding path program 1 times [2023-11-24 22:03:32,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:32,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125315248] [2023-11-24 22:03:32,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:32,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:32,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:32,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125315248] [2023-11-24 22:03:32,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125315248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:32,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:32,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:03:32,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604484972] [2023-11-24 22:03:32,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:32,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:32,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:32,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:32,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:32,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2023-11-24 22:03:32,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:32,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2023-11-24 22:03:32,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:32,662 INFO L124 PetriNetUnfolderBase]: 162/395 cut-off events. [2023-11-24 22:03:32,662 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-24 22:03:32,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 395 events. 162/395 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2074 event pairs, 72 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 716. Up to 242 conditions per place. [2023-11-24 22:03:32,667 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 21 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-11-24 22:03:32,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 130 flow [2023-11-24 22:03:32,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:32,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2023-11-24 22:03:32,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2023-11-24 22:03:32,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 78 transitions. [2023-11-24 22:03:32,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 78 transitions. [2023-11-24 22:03:32,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:32,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 78 transitions. [2023-11-24 22:03:32,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,673 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 72 flow. Second operand 3 states and 78 transitions. [2023-11-24 22:03:32,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 130 flow [2023-11-24 22:03:32,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:32,676 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 70 flow [2023-11-24 22:03:32,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-11-24 22:03:32,678 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2023-11-24 22:03:32,679 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 70 flow [2023-11-24 22:03:32,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:32,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:03:32,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 22:03:32,682 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:32,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:32,683 INFO L85 PathProgramCache]: Analyzing trace with hash 339843574, now seen corresponding path program 1 times [2023-11-24 22:03:32,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:32,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468278512] [2023-11-24 22:03:32,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:32,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:32,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:32,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468278512] [2023-11-24 22:03:32,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468278512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:32,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:32,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:03:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920041051] [2023-11-24 22:03:32,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:32,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:32,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:32,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:32,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:32,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 41 [2023-11-24 22:03:32,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:32,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 41 [2023-11-24 22:03:32,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:32,930 INFO L124 PetriNetUnfolderBase]: 159/388 cut-off events. [2023-11-24 22:03:32,931 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-24 22:03:32,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 388 events. 159/388 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2029 event pairs, 72 based on Foata normal form. 4/380 useless extension candidates. Maximal degree in co-relation 691. Up to 235 conditions per place. [2023-11-24 22:03:32,935 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 20 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2023-11-24 22:03:32,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 124 flow [2023-11-24 22:03:32,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:32,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2023-11-24 22:03:32,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6504065040650406 [2023-11-24 22:03:32,938 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 80 transitions. [2023-11-24 22:03:32,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 80 transitions. [2023-11-24 22:03:32,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:32,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 80 transitions. [2023-11-24 22:03:32,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,941 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,941 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 70 flow. Second operand 3 states and 80 transitions. [2023-11-24 22:03:32,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 124 flow [2023-11-24 22:03:32,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:32,943 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2023-11-24 22:03:32,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-11-24 22:03:32,945 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -7 predicate places. [2023-11-24 22:03:32,945 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2023-11-24 22:03:32,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:32,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:32,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:32,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 22:03:32,946 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:32,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1560237220, now seen corresponding path program 1 times [2023-11-24 22:03:32,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:32,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036743644] [2023-11-24 22:03:32,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:32,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:33,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:33,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036743644] [2023-11-24 22:03:33,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036743644] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:33,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:33,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:03:33,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282880611] [2023-11-24 22:03:33,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:33,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 22:03:33,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:33,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 22:03:33,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 22:03:33,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2023-11-24 22:03:33,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:33,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:33,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2023-11-24 22:03:33,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:33,792 INFO L124 PetriNetUnfolderBase]: 204/409 cut-off events. [2023-11-24 22:03:33,792 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-24 22:03:33,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 409 events. 204/409 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1974 event pairs, 0 based on Foata normal form. 20/425 useless extension candidates. Maximal degree in co-relation 789. Up to 248 conditions per place. [2023-11-24 22:03:33,797 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 25 selfloop transitions, 3 changer transitions 9/48 dead transitions. [2023-11-24 22:03:33,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 180 flow [2023-11-24 22:03:33,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:03:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:03:33,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2023-11-24 22:03:33,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2023-11-24 22:03:33,800 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 140 transitions. [2023-11-24 22:03:33,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 140 transitions. [2023-11-24 22:03:33,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:33,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 140 transitions. [2023-11-24 22:03:33,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:33,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 41.0) internal successors, (287), 7 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:33,806 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 41.0) internal successors, (287), 7 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:33,806 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 6 states and 140 transitions. [2023-11-24 22:03:33,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 180 flow [2023-11-24 22:03:33,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:33,810 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 66 flow [2023-11-24 22:03:33,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-11-24 22:03:33,813 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2023-11-24 22:03:33,813 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 66 flow [2023-11-24 22:03:33,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:33,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:33,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:33,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 22:03:33,814 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:33,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:33,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1560238618, now seen corresponding path program 1 times [2023-11-24 22:03:33,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:33,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108487415] [2023-11-24 22:03:33,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:33,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:34,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:34,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108487415] [2023-11-24 22:03:34,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108487415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:34,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:34,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:03:34,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096350337] [2023-11-24 22:03:34,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:34,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:34,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:34,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:34,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:34,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2023-11-24 22:03:34,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:34,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:34,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2023-11-24 22:03:34,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:34,394 INFO L124 PetriNetUnfolderBase]: 284/573 cut-off events. [2023-11-24 22:03:34,394 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-24 22:03:34,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 573 events. 284/573 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3040 event pairs, 51 based on Foata normal form. 0/550 useless extension candidates. Maximal degree in co-relation 1105. Up to 281 conditions per place. [2023-11-24 22:03:34,399 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 21 selfloop transitions, 2 changer transitions 32/65 dead transitions. [2023-11-24 22:03:34,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 254 flow [2023-11-24 22:03:34,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 22:03:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 22:03:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2023-11-24 22:03:34,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5884146341463414 [2023-11-24 22:03:34,401 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 193 transitions. [2023-11-24 22:03:34,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 193 transitions. [2023-11-24 22:03:34,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:34,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 193 transitions. [2023-11-24 22:03:34,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 24.125) internal successors, (193), 8 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:34,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 41.0) internal successors, (369), 9 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:34,404 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 41.0) internal successors, (369), 9 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:34,405 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 66 flow. Second operand 8 states and 193 transitions. [2023-11-24 22:03:34,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 254 flow [2023-11-24 22:03:34,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 247 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 22:03:34,407 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 75 flow [2023-11-24 22:03:34,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=75, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2023-11-24 22:03:34,408 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2023-11-24 22:03:34,409 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 75 flow [2023-11-24 22:03:34,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:34,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:34,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:34,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 22:03:34,410 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:34,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:34,410 INFO L85 PathProgramCache]: Analyzing trace with hash 963608313, now seen corresponding path program 1 times [2023-11-24 22:03:34,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:34,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112599075] [2023-11-24 22:03:34,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:34,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:34,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:34,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112599075] [2023-11-24 22:03:34,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112599075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:34,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:34,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:03:34,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807823661] [2023-11-24 22:03:34,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:34,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:03:34,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:34,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:03:34,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:03:34,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2023-11-24 22:03:34,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 75 flow. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:34,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:34,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2023-11-24 22:03:34,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:35,049 INFO L124 PetriNetUnfolderBase]: 289/587 cut-off events. [2023-11-24 22:03:35,050 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-24 22:03:35,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1309 conditions, 587 events. 289/587 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2957 event pairs, 45 based on Foata normal form. 20/605 useless extension candidates. Maximal degree in co-relation 1293. Up to 237 conditions per place. [2023-11-24 22:03:35,055 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 35 selfloop transitions, 6 changer transitions 34/84 dead transitions. [2023-11-24 22:03:35,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 84 transitions, 375 flow [2023-11-24 22:03:35,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 22:03:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-24 22:03:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 287 transitions. [2023-11-24 22:03:35,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2023-11-24 22:03:35,058 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 287 transitions. [2023-11-24 22:03:35,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 287 transitions. [2023-11-24 22:03:35,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:35,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 287 transitions. [2023-11-24 22:03:35,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 22.076923076923077) internal successors, (287), 13 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:35,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 41.0) internal successors, (574), 14 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:35,062 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 41.0) internal successors, (574), 14 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:35,063 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 75 flow. Second operand 13 states and 287 transitions. [2023-11-24 22:03:35,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 84 transitions, 375 flow [2023-11-24 22:03:35,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 84 transitions, 337 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-11-24 22:03:35,069 INFO L231 Difference]: Finished difference. Result has 56 places, 31 transitions, 115 flow [2023-11-24 22:03:35,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=115, PETRI_PLACES=56, PETRI_TRANSITIONS=31} [2023-11-24 22:03:35,070 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2023-11-24 22:03:35,071 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 31 transitions, 115 flow [2023-11-24 22:03:35,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:35,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:35,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:35,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 22:03:35,072 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:35,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:35,072 INFO L85 PathProgramCache]: Analyzing trace with hash -108774349, now seen corresponding path program 1 times [2023-11-24 22:03:35,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:35,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499311404] [2023-11-24 22:03:35,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:35,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:35,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:35,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499311404] [2023-11-24 22:03:35,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499311404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:35,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:35,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:03:35,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385783884] [2023-11-24 22:03:35,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:35,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:03:35,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:35,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:03:35,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:03:35,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2023-11-24 22:03:35,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 31 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:35,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:35,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2023-11-24 22:03:35,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:35,738 INFO L124 PetriNetUnfolderBase]: 295/596 cut-off events. [2023-11-24 22:03:35,738 INFO L125 PetriNetUnfolderBase]: For 537/540 co-relation queries the response was YES. [2023-11-24 22:03:35,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1551 conditions, 596 events. 295/596 cut-off events. For 537/540 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3016 event pairs, 96 based on Foata normal form. 17/611 useless extension candidates. Maximal degree in co-relation 1529. Up to 204 conditions per place. [2023-11-24 22:03:35,745 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 25 selfloop transitions, 3 changer transitions 28/65 dead transitions. [2023-11-24 22:03:35,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 329 flow [2023-11-24 22:03:35,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 22:03:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 22:03:35,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2023-11-24 22:03:35,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5640243902439024 [2023-11-24 22:03:35,748 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 185 transitions. [2023-11-24 22:03:35,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 185 transitions. [2023-11-24 22:03:35,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:35,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 185 transitions. [2023-11-24 22:03:35,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.125) internal successors, (185), 8 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:35,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 41.0) internal successors, (369), 9 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:35,752 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 41.0) internal successors, (369), 9 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:35,752 INFO L175 Difference]: Start difference. First operand has 56 places, 31 transitions, 115 flow. Second operand 8 states and 185 transitions. [2023-11-24 22:03:35,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 329 flow [2023-11-24 22:03:35,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 65 transitions, 297 flow, removed 16 selfloop flow, removed 8 redundant places. [2023-11-24 22:03:35,761 INFO L231 Difference]: Finished difference. Result has 53 places, 27 transitions, 101 flow [2023-11-24 22:03:35,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=101, PETRI_PLACES=53, PETRI_TRANSITIONS=27} [2023-11-24 22:03:35,762 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-11-24 22:03:35,763 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 27 transitions, 101 flow [2023-11-24 22:03:35,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:35,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:35,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:35,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 22:03:35,764 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:35,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:35,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1296545205, now seen corresponding path program 1 times [2023-11-24 22:03:35,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:35,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547046161] [2023-11-24 22:03:35,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:35,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:35,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:35,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547046161] [2023-11-24 22:03:35,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547046161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:35,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:35,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:03:35,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16796889] [2023-11-24 22:03:35,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:35,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:03:35,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:35,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:03:35,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:03:35,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2023-11-24 22:03:35,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 27 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:35,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:35,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2023-11-24 22:03:35,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:36,138 INFO L124 PetriNetUnfolderBase]: 165/362 cut-off events. [2023-11-24 22:03:36,138 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2023-11-24 22:03:36,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 362 events. 165/362 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1499 event pairs, 28 based on Foata normal form. 21/377 useless extension candidates. Maximal degree in co-relation 840. Up to 166 conditions per place. [2023-11-24 22:03:36,142 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 29 selfloop transitions, 4 changer transitions 1/43 dead transitions. [2023-11-24 22:03:36,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 207 flow [2023-11-24 22:03:36,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:03:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 22:03:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2023-11-24 22:03:36,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2023-11-24 22:03:36,149 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 104 transitions. [2023-11-24 22:03:36,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 104 transitions. [2023-11-24 22:03:36,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:36,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 104 transitions. [2023-11-24 22:03:36,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.0) internal successors, (104), 4 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) [2023-11-24 22:03:36,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,153 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,153 INFO L175 Difference]: Start difference. First operand has 53 places, 27 transitions, 101 flow. Second operand 4 states and 104 transitions. [2023-11-24 22:03:36,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 207 flow [2023-11-24 22:03:36,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 167 flow, removed 11 selfloop flow, removed 13 redundant places. [2023-11-24 22:03:36,161 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 91 flow [2023-11-24 22:03:36,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-11-24 22:03:36,165 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2023-11-24 22:03:36,165 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 91 flow [2023-11-24 22:03:36,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:36,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:36,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 22:03:36,166 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:36,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:36,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1251362966, now seen corresponding path program 1 times [2023-11-24 22:03:36,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:36,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574063118] [2023-11-24 22:03:36,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:36,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:36,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:36,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574063118] [2023-11-24 22:03:36,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574063118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:36,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:36,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:03:36,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921678850] [2023-11-24 22:03:36,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:36,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:36,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:36,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:36,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:36,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2023-11-24 22:03:36,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:36,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2023-11-24 22:03:36,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:36,576 INFO L124 PetriNetUnfolderBase]: 87/197 cut-off events. [2023-11-24 22:03:36,576 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-24 22:03:36,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 197 events. 87/197 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 586 event pairs, 19 based on Foata normal form. 14/207 useless extension candidates. Maximal degree in co-relation 457. Up to 71 conditions per place. [2023-11-24 22:03:36,579 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 25 selfloop transitions, 6 changer transitions 1/41 dead transitions. [2023-11-24 22:03:36,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 184 flow [2023-11-24 22:03:36,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 22:03:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2023-11-24 22:03:36,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5804878048780487 [2023-11-24 22:03:36,582 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 119 transitions. [2023-11-24 22:03:36,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 119 transitions. [2023-11-24 22:03:36,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:36,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 119 transitions. [2023-11-24 22:03:36,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,584 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,585 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 91 flow. Second operand 5 states and 119 transitions. [2023-11-24 22:03:36,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 184 flow [2023-11-24 22:03:36,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 171 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-24 22:03:36,587 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 103 flow [2023-11-24 22:03:36,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-11-24 22:03:36,588 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2023-11-24 22:03:36,588 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 103 flow [2023-11-24 22:03:36,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:36,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:36,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:36,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 22:03:36,590 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:36,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:36,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1176759713, now seen corresponding path program 1 times [2023-11-24 22:03:36,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:36,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515057000] [2023-11-24 22:03:36,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:36,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:37,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:37,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:37,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515057000] [2023-11-24 22:03:37,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515057000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:37,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:37,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 22:03:37,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662823291] [2023-11-24 22:03:37,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:37,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 22:03:37,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:37,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 22:03:37,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-24 22:03:37,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2023-11-24 22:03:37,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 103 flow. Second operand has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:37,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:37,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2023-11-24 22:03:37,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:38,125 INFO L124 PetriNetUnfolderBase]: 88/217 cut-off events. [2023-11-24 22:03:38,125 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-11-24 22:03:38,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 217 events. 88/217 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 746 event pairs, 39 based on Foata normal form. 4/214 useless extension candidates. Maximal degree in co-relation 500. Up to 79 conditions per place. [2023-11-24 22:03:38,128 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 18 selfloop transitions, 4 changer transitions 21/55 dead transitions. [2023-11-24 22:03:38,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 253 flow [2023-11-24 22:03:38,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 22:03:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 22:03:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 197 transitions. [2023-11-24 22:03:38,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5338753387533876 [2023-11-24 22:03:38,130 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 197 transitions. [2023-11-24 22:03:38,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 197 transitions. [2023-11-24 22:03:38,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:38,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 197 transitions. [2023-11-24 22:03:38,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 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) [2023-11-24 22:03:38,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 41.0) internal successors, (410), 10 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:38,134 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 41.0) internal successors, (410), 10 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:38,134 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 103 flow. Second operand 9 states and 197 transitions. [2023-11-24 22:03:38,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 253 flow [2023-11-24 22:03:38,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 219 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-24 22:03:38,137 INFO L231 Difference]: Finished difference. Result has 51 places, 29 transitions, 101 flow [2023-11-24 22:03:38,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=101, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2023-11-24 22:03:38,138 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2023-11-24 22:03:38,138 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 101 flow [2023-11-24 22:03:38,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:38,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:38,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:38,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 22:03:38,139 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:38,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:38,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1998607743, now seen corresponding path program 2 times [2023-11-24 22:03:38,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:38,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831894594] [2023-11-24 22:03:38,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:38,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:03:38,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 22:03:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:03:38,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 22:03:38,287 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 22:03:38,288 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-24 22:03:38,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-24 22:03:38,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-24 22:03:38,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-24 22:03:38,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-24 22:03:38,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-24 22:03:38,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-24 22:03:38,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-24 22:03:38,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-24 22:03:38,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-24 22:03:38,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 22:03:38,293 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:38,300 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 22:03:38,300 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 22:03:38,347 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 22:03:38,350 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 22:03:38,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:03:38,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:03:38,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 10:03:38 BasicIcfg [2023-11-24 22:03:38,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 22:03:38,374 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 22:03:38,374 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 22:03:38,375 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 22:03:38,375 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:30" (3/4) ... [2023-11-24 22:03:38,378 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 22:03:38,379 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 22:03:38,380 INFO L158 Benchmark]: Toolchain (without parser) took 9815.80ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 118.7MB in the beginning and 137.8MB in the end (delta: -19.1MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2023-11-24 22:03:38,380 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 115.3MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:03:38,381 INFO L158 Benchmark]: CACSL2BoogieTranslator took 704.70ms. Allocated memory is still 153.1MB. Free memory was 118.1MB in the beginning and 95.3MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 22:03:38,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.23ms. Allocated memory is still 153.1MB. Free memory was 95.3MB in the beginning and 93.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 22:03:38,382 INFO L158 Benchmark]: Boogie Preprocessor took 127.97ms. Allocated memory is still 153.1MB. Free memory was 93.2MB in the beginning and 120.7MB in the end (delta: -27.4MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2023-11-24 22:03:38,382 INFO L158 Benchmark]: RCFGBuilder took 1138.11ms. Allocated memory is still 153.1MB. Free memory was 120.7MB in the beginning and 77.5MB in the end (delta: 43.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2023-11-24 22:03:38,382 INFO L158 Benchmark]: TraceAbstraction took 7763.62ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 76.7MB in the beginning and 137.8MB in the end (delta: -61.1MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2023-11-24 22:03:38,383 INFO L158 Benchmark]: Witness Printer took 4.84ms. Allocated memory is still 222.3MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:03:38,385 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.22ms. Allocated memory is still 115.3MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 704.70ms. Allocated memory is still 153.1MB. Free memory was 118.1MB in the beginning and 95.3MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.23ms. Allocated memory is still 153.1MB. Free memory was 95.3MB in the beginning and 93.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.97ms. Allocated memory is still 153.1MB. Free memory was 93.2MB in the beginning and 120.7MB in the end (delta: -27.4MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1138.11ms. Allocated memory is still 153.1MB. Free memory was 120.7MB in the beginning and 77.5MB in the end (delta: 43.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7763.62ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 76.7MB in the beginning and 137.8MB in the end (delta: -61.1MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Witness Printer took 4.84ms. Allocated memory is still 222.3MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L807] 0 pthread_t t2305; [L808] FCALL, FORK 0 pthread_create(&t2305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L809] 0 pthread_t t2306; [L810] FCALL, FORK 0 pthread_create(&t2306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2305={5:0}, t2306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EBX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L788] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L789] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305={5:0}, t2306={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L814] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L814] RET 0 assume_abort_if_not(main$tmp_guard0) [L816] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L817] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L818] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L819] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L820] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305={5:0}, t2306={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L823] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305={5:0}, t2306={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L825] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L17] 0 __assert_fail ("0", "safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 808]: 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: 810]: 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 5 procedures, 57 locations, 10 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: 7.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 444 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 377 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1019 IncrementalHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 23 mSDtfsCounter, 1019 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=8, InterpolantAutomatonStates: 68, 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.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1178 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-24 22:03:38,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI --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 fdecd751bbf3d5ef761eacebee2616261a6cad4ae3645147e0ad096bd1775198 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 22:03:41,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 22:03:41,568 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 22:03:41,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 22:03:41,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 22:03:41,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 22:03:41,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 22:03:41,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 22:03:41,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 22:03:41,618 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 22:03:41,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 22:03:41,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 22:03:41,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 22:03:41,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 22:03:41,622 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 22:03:41,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 22:03:41,623 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 22:03:41,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 22:03:41,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 22:03:41,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 22:03:41,626 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 22:03:41,626 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 22:03:41,627 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 22:03:41,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 22:03:41,628 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 22:03:41,629 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 22:03:41,629 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 22:03:41,630 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 22:03:41,631 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 22:03:41,631 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 22:03:41,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 22:03:41,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 22:03:41,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 22:03:41,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 22:03:41,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:03:41,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 22:03:41,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 22:03:41,635 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 22:03:41,635 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 22:03:41,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 22:03:41,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 22:03:41,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 22:03:41,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 22:03:41,636 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 22:03:41,637 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI 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 -> fdecd751bbf3d5ef761eacebee2616261a6cad4ae3645147e0ad096bd1775198 [2023-11-24 22:03:42,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 22:03:42,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 22:03:42,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 22:03:42,160 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 22:03:42,161 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 22:03:42,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-24 22:03:45,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 22:03:45,884 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 22:03:45,885 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-24 22:03:45,911 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/data/7dfe8095a/c7cd94b691324399b91cdd10dc926843/FLAG2981a6b1a [2023-11-24 22:03:45,926 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/data/7dfe8095a/c7cd94b691324399b91cdd10dc926843 [2023-11-24 22:03:45,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 22:03:45,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 22:03:45,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 22:03:45,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 22:03:45,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 22:03:45,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:03:45" (1/1) ... [2023-11-24 22:03:45,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48555696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:45, skipping insertion in model container [2023-11-24 22:03:45,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:03:45" (1/1) ... [2023-11-24 22:03:46,016 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 22:03:46,598 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:03:46,620 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 22:03:46,724 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:03:46,794 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:03:46,794 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:03:46,802 INFO L206 MainTranslator]: Completed translation [2023-11-24 22:03:46,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:46 WrapperNode [2023-11-24 22:03:46,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 22:03:46,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 22:03:46,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 22:03:46,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 22:03:46,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:46" (1/1) ... [2023-11-24 22:03:46,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:46" (1/1) ... [2023-11-24 22:03:46,903 INFO L138 Inliner]: procedures = 178, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119 [2023-11-24 22:03:46,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 22:03:46,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 22:03:46,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 22:03:46,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 22:03:46,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:46" (1/1) ... [2023-11-24 22:03:46,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:46" (1/1) ... [2023-11-24 22:03:46,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:46" (1/1) ... [2023-11-24 22:03:46,968 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-24 22:03:46,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:46" (1/1) ... [2023-11-24 22:03:46,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:46" (1/1) ... [2023-11-24 22:03:46,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:46" (1/1) ... [2023-11-24 22:03:47,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:46" (1/1) ... [2023-11-24 22:03:47,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:46" (1/1) ... [2023-11-24 22:03:47,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:46" (1/1) ... [2023-11-24 22:03:47,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 22:03:47,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 22:03:47,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 22:03:47,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 22:03:47,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:46" (1/1) ... [2023-11-24 22:03:47,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:03:47,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:03:47,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 22:03:47,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 22:03:47,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 22:03:47,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 22:03:47,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 22:03:47,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 22:03:47,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-24 22:03:47,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-24 22:03:47,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-24 22:03:47,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-24 22:03:47,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-24 22:03:47,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-24 22:03:47,107 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 22:03:47,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 22:03:47,107 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 22:03:47,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 22:03:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 22:03:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 22:03:47,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 22:03:47,111 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 22:03:47,317 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 22:03:47,324 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 22:03:47,683 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 22:03:48,005 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 22:03:48,006 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 22:03:48,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:48 BoogieIcfgContainer [2023-11-24 22:03:48,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 22:03:48,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 22:03:48,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 22:03:48,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 22:03:48,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:03:45" (1/3) ... [2023-11-24 22:03:48,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289f9c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:03:48, skipping insertion in model container [2023-11-24 22:03:48,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:46" (2/3) ... [2023-11-24 22:03:48,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289f9c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:03:48, skipping insertion in model container [2023-11-24 22:03:48,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:48" (3/3) ... [2023-11-24 22:03:48,021 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-24 22:03:48,042 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 22:03:48,042 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 22:03:48,042 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 22:03:48,107 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 22:03:48,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 90 flow [2023-11-24 22:03:48,188 INFO L124 PetriNetUnfolderBase]: 2/39 cut-off events. [2023-11-24 22:03:48,189 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:03:48,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 39 events. 2/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2023-11-24 22:03:48,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 41 transitions, 90 flow [2023-11-24 22:03:48,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 39 transitions, 84 flow [2023-11-24 22:03:48,212 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 22:03:48,220 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@65c3f179, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 22:03:48,225 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-24 22:03:48,231 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 22:03:48,232 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 22:03:48,232 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:03:48,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:48,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:03:48,235 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:48,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:48,241 INFO L85 PathProgramCache]: Analyzing trace with hash 11461, now seen corresponding path program 1 times [2023-11-24 22:03:48,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:48,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257692775] [2023-11-24 22:03:48,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:48,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:48,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:48,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:48,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-24 22:03:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:48,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:03:48,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:48,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-24 22:03:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:48,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:48,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:48,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257692775] [2023-11-24 22:03:48,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257692775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:48,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:48,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:03:48,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141618313] [2023-11-24 22:03:48,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:48,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:48,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:48,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:48,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:48,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2023-11-24 22:03:48,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:48,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:48,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2023-11-24 22:03:48,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:48,940 INFO L124 PetriNetUnfolderBase]: 237/553 cut-off events. [2023-11-24 22:03:48,941 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-24 22:03:48,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 553 events. 237/553 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3154 event pairs, 175 based on Foata normal form. 40/532 useless extension candidates. Maximal degree in co-relation 965. Up to 307 conditions per place. [2023-11-24 22:03:48,954 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 24 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-24 22:03:48,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 142 flow [2023-11-24 22:03:48,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2023-11-24 22:03:48,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6747967479674797 [2023-11-24 22:03:48,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 83 transitions. [2023-11-24 22:03:48,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 83 transitions. [2023-11-24 22:03:48,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:48,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 83 transitions. [2023-11-24 22:03:48,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:48,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:48,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:48,990 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 84 flow. Second operand 3 states and 83 transitions. [2023-11-24 22:03:48,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 142 flow [2023-11-24 22:03:48,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:48,997 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-24 22:03:48,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-24 22:03:49,003 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2023-11-24 22:03:49,003 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-24 22:03:49,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:49,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:49,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:03:49,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-24 22:03:49,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:49,207 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:49,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:49,208 INFO L85 PathProgramCache]: Analyzing trace with hash 11462, now seen corresponding path program 1 times [2023-11-24 22:03:49,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:49,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55619291] [2023-11-24 22:03:49,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:49,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:49,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:49,210 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:49,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-24 22:03:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:49,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:03:49,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:49,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 22:03:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:49,376 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:49,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:49,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55619291] [2023-11-24 22:03:49,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55619291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:49,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:49,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:03:49,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784314346] [2023-11-24 22:03:49,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:49,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:49,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:49,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:49,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:49,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 41 [2023-11-24 22:03:49,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:49,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:49,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 41 [2023-11-24 22:03:49,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:49,575 INFO L124 PetriNetUnfolderBase]: 237/552 cut-off events. [2023-11-24 22:03:49,576 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 22:03:49,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 552 events. 237/552 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3111 event pairs, 175 based on Foata normal form. 1/492 useless extension candidates. Maximal degree in co-relation 985. Up to 306 conditions per place. [2023-11-24 22:03:49,582 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 23 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-24 22:03:49,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 140 flow [2023-11-24 22:03:49,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:49,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2023-11-24 22:03:49,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6747967479674797 [2023-11-24 22:03:49,585 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 83 transitions. [2023-11-24 22:03:49,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 83 transitions. [2023-11-24 22:03:49,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:49,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 83 transitions. [2023-11-24 22:03:49,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:49,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:49,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:49,588 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 83 transitions. [2023-11-24 22:03:49,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 140 flow [2023-11-24 22:03:49,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:49,591 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-24 22:03:49,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-11-24 22:03:49,592 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-24 22:03:49,593 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-24 22:03:49,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:49,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:49,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:03:49,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:49,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:49,796 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:49,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:49,797 INFO L85 PathProgramCache]: Analyzing trace with hash 341752892, now seen corresponding path program 1 times [2023-11-24 22:03:49,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:49,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107896433] [2023-11-24 22:03:49,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:49,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:49,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:49,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:49,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-24 22:03:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:49,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 22:03:49,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:49,920 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:49,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:49,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107896433] [2023-11-24 22:03:49,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107896433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:49,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:49,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:03:49,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640450369] [2023-11-24 22:03:49,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:49,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:49,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:49,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:49,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:49,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2023-11-24 22:03:49,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:49,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:49,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2023-11-24 22:03:49,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:50,066 INFO L124 PetriNetUnfolderBase]: 183/393 cut-off events. [2023-11-24 22:03:50,067 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-24 22:03:50,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 393 events. 183/393 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1903 event pairs, 69 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 732. Up to 265 conditions per place. [2023-11-24 22:03:50,070 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 25 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-11-24 22:03:50,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 160 flow [2023-11-24 22:03:50,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-24 22:03:50,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7317073170731707 [2023-11-24 22:03:50,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-24 22:03:50,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-24 22:03:50,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:50,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-24 22:03:50,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:50,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:50,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:50,083 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 90 transitions. [2023-11-24 22:03:50,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 160 flow [2023-11-24 22:03:50,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:50,086 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 72 flow [2023-11-24 22:03:50,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-11-24 22:03:50,088 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2023-11-24 22:03:50,088 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 72 flow [2023-11-24 22:03:50,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:50,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:50,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:03:50,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:50,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:50,292 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:50,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:50,293 INFO L85 PathProgramCache]: Analyzing trace with hash 341752183, now seen corresponding path program 1 times [2023-11-24 22:03:50,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:50,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264906421] [2023-11-24 22:03:50,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:50,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:50,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:50,295 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:50,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-24 22:03:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:50,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:03:50,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:50,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-24 22:03:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:50,382 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:50,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:50,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264906421] [2023-11-24 22:03:50,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264906421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:50,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:50,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:03:50,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934873365] [2023-11-24 22:03:50,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:50,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:50,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:50,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:50,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:50,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2023-11-24 22:03:50,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:50,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:50,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2023-11-24 22:03:50,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:50,534 INFO L124 PetriNetUnfolderBase]: 162/395 cut-off events. [2023-11-24 22:03:50,535 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-24 22:03:50,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 395 events. 162/395 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2070 event pairs, 72 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 716. Up to 242 conditions per place. [2023-11-24 22:03:50,539 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 21 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-11-24 22:03:50,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 130 flow [2023-11-24 22:03:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2023-11-24 22:03:50,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2023-11-24 22:03:50,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 78 transitions. [2023-11-24 22:03:50,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 78 transitions. [2023-11-24 22:03:50,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:50,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 78 transitions. [2023-11-24 22:03:50,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:50,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:50,543 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:50,544 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 72 flow. Second operand 3 states and 78 transitions. [2023-11-24 22:03:50,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 130 flow [2023-11-24 22:03:50,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:50,546 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 70 flow [2023-11-24 22:03:50,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-11-24 22:03:50,547 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2023-11-24 22:03:50,547 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 70 flow [2023-11-24 22:03:50,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:50,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:50,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:03:50,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:50,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:50,750 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:50,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:50,751 INFO L85 PathProgramCache]: Analyzing trace with hash 341752184, now seen corresponding path program 1 times [2023-11-24 22:03:50,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:50,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887995426] [2023-11-24 22:03:50,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:50,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:50,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:50,753 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:50,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-24 22:03:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:50,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:03:50,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:50,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 22:03:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:50,863 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:50,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:50,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887995426] [2023-11-24 22:03:50,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887995426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:50,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:50,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:03:50,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744599363] [2023-11-24 22:03:50,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:50,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:50,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:50,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:50,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:50,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 41 [2023-11-24 22:03:50,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:50,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:50,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 41 [2023-11-24 22:03:50,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:51,032 INFO L124 PetriNetUnfolderBase]: 159/381 cut-off events. [2023-11-24 22:03:51,032 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-24 22:03:51,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 381 events. 159/381 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2038 event pairs, 132 based on Foata normal form. 4/373 useless extension candidates. Maximal degree in co-relation 684. Up to 235 conditions per place. [2023-11-24 22:03:51,036 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 20 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2023-11-24 22:03:51,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 124 flow [2023-11-24 22:03:51,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:03:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2023-11-24 22:03:51,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6504065040650406 [2023-11-24 22:03:51,039 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 80 transitions. [2023-11-24 22:03:51,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 80 transitions. [2023-11-24 22:03:51,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:51,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 80 transitions. [2023-11-24 22:03:51,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:51,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:51,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:51,043 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 70 flow. Second operand 3 states and 80 transitions. [2023-11-24 22:03:51,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 124 flow [2023-11-24 22:03:51,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:51,045 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2023-11-24 22:03:51,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-11-24 22:03:51,049 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -7 predicate places. [2023-11-24 22:03:51,049 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2023-11-24 22:03:51,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:51,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:51,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:51,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:51,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:51,253 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:51,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash 953539302, now seen corresponding path program 1 times [2023-11-24 22:03:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:51,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801950630] [2023-11-24 22:03:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:51,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:51,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:51,257 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:51,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-24 22:03:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:51,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:03:51,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:51,399 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:51,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:51,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801950630] [2023-11-24 22:03:51,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801950630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:51,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:51,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:03:51,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663700310] [2023-11-24 22:03:51,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:51,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:03:51,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:51,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:03:51,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:03:51,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2023-11-24 22:03:51,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:51,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:51,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2023-11-24 22:03:51,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:51,615 INFO L124 PetriNetUnfolderBase]: 220/494 cut-off events. [2023-11-24 22:03:51,615 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 22:03:51,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 494 events. 220/494 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2472 event pairs, 38 based on Foata normal form. 25/510 useless extension candidates. Maximal degree in co-relation 922. Up to 229 conditions per place. [2023-11-24 22:03:51,621 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 32 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2023-11-24 22:03:51,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 182 flow [2023-11-24 22:03:51,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:03:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 22:03:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2023-11-24 22:03:51,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6524390243902439 [2023-11-24 22:03:51,623 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 107 transitions. [2023-11-24 22:03:51,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 107 transitions. [2023-11-24 22:03:51,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:51,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 107 transitions. [2023-11-24 22:03:51,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:51,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:51,626 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:51,626 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 4 states and 107 transitions. [2023-11-24 22:03:51,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 182 flow [2023-11-24 22:03:51,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:51,630 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 90 flow [2023-11-24 22:03:51,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-11-24 22:03:51,636 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2023-11-24 22:03:51,636 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 90 flow [2023-11-24 22:03:51,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:51,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:51,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:51,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:51,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:51,839 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:51,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1061253171, now seen corresponding path program 1 times [2023-11-24 22:03:51,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:51,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149804453] [2023-11-24 22:03:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:51,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:51,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:51,842 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:51,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-24 22:03:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:51,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:03:51,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:52,009 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:52,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:52,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149804453] [2023-11-24 22:03:52,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149804453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:52,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:52,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:03:52,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888443454] [2023-11-24 22:03:52,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:52,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:52,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:52,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:52,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:52,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2023-11-24 22:03:52,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:52,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:52,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2023-11-24 22:03:52,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:52,169 INFO L124 PetriNetUnfolderBase]: 106/239 cut-off events. [2023-11-24 22:03:52,169 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-24 22:03:52,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 239 events. 106/239 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 814 event pairs, 26 based on Foata normal form. 16/250 useless extension candidates. Maximal degree in co-relation 531. Up to 86 conditions per place. [2023-11-24 22:03:52,172 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 27 selfloop transitions, 6 changer transitions 1/45 dead transitions. [2023-11-24 22:03:52,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 189 flow [2023-11-24 22:03:52,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 22:03:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2023-11-24 22:03:52,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5902439024390244 [2023-11-24 22:03:52,173 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 121 transitions. [2023-11-24 22:03:52,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 121 transitions. [2023-11-24 22:03:52,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:52,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 121 transitions. [2023-11-24 22:03:52,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.2) internal successors, (121), 5 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) [2023-11-24 22:03:52,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:52,176 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:52,176 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 90 flow. Second operand 5 states and 121 transitions. [2023-11-24 22:03:52,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 189 flow [2023-11-24 22:03:52,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 180 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 22:03:52,179 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 106 flow [2023-11-24 22:03:52,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-11-24 22:03:52,180 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2023-11-24 22:03:52,180 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 106 flow [2023-11-24 22:03:52,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:52,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:52,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:52,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:52,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:52,384 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:52,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:52,384 INFO L85 PathProgramCache]: Analyzing trace with hash 892495149, now seen corresponding path program 1 times [2023-11-24 22:03:52,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:52,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962821201] [2023-11-24 22:03:52,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:52,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:52,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:52,387 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:52,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-24 22:03:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:52,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-24 22:03:52,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:52,935 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t2305~0#1.base_47| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t2306~0#1.base_43| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2305~0#1.base_47| (_ bv1 1)) |v_ULTIMATE.start_main_~#t2306~0#1.base_43|)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2305~0#1.base_47|)) (= (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2305~0#1.base_47| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2306~0#1.base_43| (_ bv0 1)) |c_#valid|))) is different from true [2023-11-24 22:03:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:52,937 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:52,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:52,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962821201] [2023-11-24 22:03:52,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962821201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:52,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:52,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:03:52,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329826561] [2023-11-24 22:03:52,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:52,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:52,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:52,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:52,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-24 22:03:52,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2023-11-24 22:03:52,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:52,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:52,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2023-11-24 22:03:52,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:53,120 INFO L124 PetriNetUnfolderBase]: 66/179 cut-off events. [2023-11-24 22:03:53,120 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-11-24 22:03:53,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 179 events. 66/179 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 608 event pairs, 21 based on Foata normal form. 4/177 useless extension candidates. Maximal degree in co-relation 374. Up to 117 conditions per place. [2023-11-24 22:03:53,123 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 21 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2023-11-24 22:03:53,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 39 transitions, 172 flow [2023-11-24 22:03:53,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 22:03:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2023-11-24 22:03:53,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44878048780487806 [2023-11-24 22:03:53,125 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 92 transitions. [2023-11-24 22:03:53,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 92 transitions. [2023-11-24 22:03:53,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:53,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 92 transitions. [2023-11-24 22:03:53,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:53,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:53,127 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:53,127 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 106 flow. Second operand 5 states and 92 transitions. [2023-11-24 22:03:53,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 39 transitions, 172 flow [2023-11-24 22:03:53,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 144 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-24 22:03:53,130 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 101 flow [2023-11-24 22:03:53,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2023-11-24 22:03:53,132 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2023-11-24 22:03:53,132 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 101 flow [2023-11-24 22:03:53,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:53,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:53,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:53,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:53,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:53,336 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:53,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:53,337 INFO L85 PathProgramCache]: Analyzing trace with hash 892496547, now seen corresponding path program 1 times [2023-11-24 22:03:53,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:53,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19590398] [2023-11-24 22:03:53,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:53,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:53,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:53,339 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:53,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-24 22:03:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:53,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-24 22:03:53,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:53,717 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:53,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:53,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19590398] [2023-11-24 22:03:53,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19590398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:53,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:53,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 22:03:53,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148986698] [2023-11-24 22:03:53,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:53,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 22:03:53,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:53,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 22:03:53,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 22:03:53,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 41 [2023-11-24 22:03:53,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 101 flow. Second operand has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:53,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:53,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 41 [2023-11-24 22:03:53,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:54,068 INFO L124 PetriNetUnfolderBase]: 101/266 cut-off events. [2023-11-24 22:03:54,068 INFO L125 PetriNetUnfolderBase]: For 91/95 co-relation queries the response was YES. [2023-11-24 22:03:54,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 266 events. 101/266 cut-off events. For 91/95 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1059 event pairs, 17 based on Foata normal form. 4/263 useless extension candidates. Maximal degree in co-relation 605. Up to 91 conditions per place. [2023-11-24 22:03:54,071 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 40 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2023-11-24 22:03:54,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 298 flow [2023-11-24 22:03:54,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 22:03:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 22:03:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions. [2023-11-24 22:03:54,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5880758807588076 [2023-11-24 22:03:54,074 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 217 transitions. [2023-11-24 22:03:54,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 217 transitions. [2023-11-24 22:03:54,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:54,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 217 transitions. [2023-11-24 22:03:54,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 24.11111111111111) internal successors, (217), 9 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:54,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 41.0) internal successors, (410), 10 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:54,077 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 41.0) internal successors, (410), 10 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:54,077 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 101 flow. Second operand 9 states and 217 transitions. [2023-11-24 22:03:54,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 298 flow [2023-11-24 22:03:54,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 284 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 22:03:54,081 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 144 flow [2023-11-24 22:03:54,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=144, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-11-24 22:03:54,082 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2023-11-24 22:03:54,082 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 144 flow [2023-11-24 22:03:54,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:54,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:54,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:54,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-24 22:03:54,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:54,286 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:54,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1747209437, now seen corresponding path program 2 times [2023-11-24 22:03:54,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:54,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259174353] [2023-11-24 22:03:54,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 22:03:54,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:54,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:54,288 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:54,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-24 22:03:54,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-24 22:03:54,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 22:03:54,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 22:03:54,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:54,493 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:03:54,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:03:54,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259174353] [2023-11-24 22:03:54,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259174353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:54,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:54,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:03:54,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016801697] [2023-11-24 22:03:54,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:54,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:03:54,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:03:54,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:03:54,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:03:54,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2023-11-24 22:03:54,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:54,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:03:54,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2023-11-24 22:03:54,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:03:54,749 INFO L124 PetriNetUnfolderBase]: 204/504 cut-off events. [2023-11-24 22:03:54,750 INFO L125 PetriNetUnfolderBase]: For 270/274 co-relation queries the response was YES. [2023-11-24 22:03:54,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 504 events. 204/504 cut-off events. For 270/274 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2477 event pairs, 81 based on Foata normal form. 4/496 useless extension candidates. Maximal degree in co-relation 1312. Up to 177 conditions per place. [2023-11-24 22:03:54,755 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 46 selfloop transitions, 9 changer transitions 0/68 dead transitions. [2023-11-24 22:03:54,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 370 flow [2023-11-24 22:03:54,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:03:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:03:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2023-11-24 22:03:54,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2023-11-24 22:03:54,757 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 144 transitions. [2023-11-24 22:03:54,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 144 transitions. [2023-11-24 22:03:54,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:03:54,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 144 transitions. [2023-11-24 22:03:54,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:54,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 41.0) internal successors, (287), 7 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:54,759 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 41.0) internal successors, (287), 7 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:54,759 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 144 flow. Second operand 6 states and 144 transitions. [2023-11-24 22:03:54,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 370 flow [2023-11-24 22:03:54,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 362 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 22:03:54,764 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 222 flow [2023-11-24 22:03:54,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2023-11-24 22:03:54,765 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2023-11-24 22:03:54,766 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 222 flow [2023-11-24 22:03:54,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:03:54,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:03:54,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:54,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:54,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:54,970 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 22:03:54,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:54,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1931373425, now seen corresponding path program 3 times [2023-11-24 22:03:54,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:03:54,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294315489] [2023-11-24 22:03:54,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 22:03:54,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:54,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:03:54,972 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 22:03:54,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-24 22:03:55,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-24 22:03:55,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-24 22:03:55,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 22:03:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:03:55,253 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-24 22:03:55,253 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 22:03:55,254 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-24 22:03:55,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-24 22:03:55,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-24 22:03:55,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-24 22:03:55,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-24 22:03:55,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-24 22:03:55,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-24 22:03:55,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-24 22:03:55,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-24 22:03:55,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-24 22:03:55,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:55,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 22:03:55,462 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:55,468 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 22:03:55,468 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 22:03:55,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 22:03:55,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 22:03:55,558 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:03:55,563 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:03:55,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 10:03:55 BasicIcfg [2023-11-24 22:03:55,579 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 22:03:55,580 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 22:03:55,580 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 22:03:55,580 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 22:03:55,581 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:48" (3/4) ... [2023-11-24 22:03:55,582 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 22:03:55,584 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 22:03:55,586 INFO L158 Benchmark]: Toolchain (without parser) took 9654.33ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 39.6MB in the beginning and 41.3MB in the end (delta: -1.7MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2023-11-24 22:03:55,587 INFO L158 Benchmark]: CDTParser took 1.61ms. Allocated memory is still 65.0MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:03:55,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 871.93ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 39.3MB in the beginning and 45.8MB in the end (delta: -6.5MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2023-11-24 22:03:55,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.94ms. Allocated memory is still 79.7MB. Free memory was 45.8MB in the beginning and 43.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 22:03:55,588 INFO L158 Benchmark]: Boogie Preprocessor took 109.31ms. Allocated memory is still 79.7MB. Free memory was 43.4MB in the beginning and 40.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 22:03:55,588 INFO L158 Benchmark]: RCFGBuilder took 990.63ms. Allocated memory is still 79.7MB. Free memory was 40.1MB in the beginning and 50.2MB in the end (delta: -10.1MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2023-11-24 22:03:55,589 INFO L158 Benchmark]: TraceAbstraction took 7569.34ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 49.8MB in the beginning and 41.3MB in the end (delta: 8.5MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2023-11-24 22:03:55,589 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 117.4MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:03:55,592 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.61ms. Allocated memory is still 65.0MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 871.93ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 39.3MB in the beginning and 45.8MB in the end (delta: -6.5MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.94ms. Allocated memory is still 79.7MB. Free memory was 45.8MB in the beginning and 43.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.31ms. Allocated memory is still 79.7MB. Free memory was 43.4MB in the beginning and 40.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 990.63ms. Allocated memory is still 79.7MB. Free memory was 40.1MB in the beginning and 50.2MB in the end (delta: -10.1MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7569.34ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 49.8MB in the beginning and 41.3MB in the end (delta: 8.5MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 117.4MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L807] 0 pthread_t t2305; [L808] FCALL, FORK 0 pthread_create(&t2305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2305={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L809] 0 pthread_t t2306; [L810] FCALL, FORK 0 pthread_create(&t2306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2305={3:0}, t2306={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EBX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L788] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L789] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305={3:0}, t2306={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L814] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L814] RET 0 assume_abort_if_not(main$tmp_guard0) [L816] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L817] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L818] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L819] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L820] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305={3:0}, t2306={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L823] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305={3:0}, t2306={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L825] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L17] 0 __assert_fail ("0", "safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 808]: 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: 810]: 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 5 procedures, 57 locations, 10 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: 7.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 265 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 37 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 686 IncrementalHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 13 mSDtfsCounter, 686 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=10, InterpolantAutomatonStates: 44, 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.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 119 ConstructedInterpolants, 1 QuantifiedInterpolants, 855 SizeOfPredicates, 9 NumberOfNonLiveVariables, 907 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-24 22:03:55,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ebcd3d4-4517-479d-8809-76683042e20e/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample