./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:39:58,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:39:58,728 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:39:58,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:39:58,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:39:58,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:39:58,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:39:58,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:39:58,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:39:58,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:39:58,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:39:58,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:39:58,794 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:39:58,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:39:58,796 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:39:58,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:39:58,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:39:58,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:39:58,798 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:39:58,798 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:39:58,799 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:39:58,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:39:58,800 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:39:58,800 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:39:58,801 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:39:58,801 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:39:58,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:39:58,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:39:58,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:39:58,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:39:58,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:39:58,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:39:58,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:39:58,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:39:58,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:39:58,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:39:58,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:39:58,807 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:39:58,808 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_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 [2023-11-06 22:39:59,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:39:59,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:39:59,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:39:59,147 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:39:59,148 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:39:59,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-06 22:40:02,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:40:02,564 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:40:02,565 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-06 22:40:02,585 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/data/54c06370f/7ecb41342d7d4ee9b105be4ef3d631d1/FLAGe0e20c45d [2023-11-06 22:40:02,611 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/data/54c06370f/7ecb41342d7d4ee9b105be4ef3d631d1 [2023-11-06 22:40:02,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:40:02,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:40:02,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:40:02,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:40:02,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:40:02,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:40:02" (1/1) ... [2023-11-06 22:40:02,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@271d8683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:02, skipping insertion in model container [2023-11-06 22:40:02,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:40:02" (1/1) ... [2023-11-06 22:40:02,712 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:40:03,138 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:40:03,150 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:40:03,239 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:40:03,299 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:40:03,299 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:40:03,308 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:40:03,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:03 WrapperNode [2023-11-06 22:40:03,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:40:03,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:40:03,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:40:03,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:40:03,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:03" (1/1) ... [2023-11-06 22:40:03,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:03" (1/1) ... [2023-11-06 22:40:03,414 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-06 22:40:03,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:40:03,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:40:03,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:40:03,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:40:03,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:03" (1/1) ... [2023-11-06 22:40:03,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:03" (1/1) ... [2023-11-06 22:40:03,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:03" (1/1) ... [2023-11-06 22:40:03,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:03" (1/1) ... [2023-11-06 22:40:03,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:03" (1/1) ... [2023-11-06 22:40:03,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:03" (1/1) ... [2023-11-06 22:40:03,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:03" (1/1) ... [2023-11-06 22:40:03,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:03" (1/1) ... [2023-11-06 22:40:03,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:40:03,497 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:40:03,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:40:03,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:40:03,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:03" (1/1) ... [2023-11-06 22:40:03,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:40:03,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:03,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:03,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:40:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:40:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:40:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:40:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:40:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:40:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:40:03,593 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:40:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:40:03,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:40:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:40:03,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:40:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:40:03,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:40:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:40:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:40:03,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:40:03,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:40:03,602 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:40:03,786 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:40:03,788 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:40:04,208 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:40:04,333 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:40:04,334 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:40:04,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:40:04 BoogieIcfgContainer [2023-11-06 22:40:04,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:40:04,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:40:04,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:40:04,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:40:04,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:40:02" (1/3) ... [2023-11-06 22:40:04,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5bd11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:40:04, skipping insertion in model container [2023-11-06 22:40:04,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:03" (2/3) ... [2023-11-06 22:40:04,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5bd11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:40:04, skipping insertion in model container [2023-11-06 22:40:04,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:40:04" (3/3) ... [2023-11-06 22:40:04,351 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-06 22:40:04,371 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:40:04,373 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:40:04,373 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:40:04,456 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:40:04,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 149 transitions, 314 flow [2023-11-06 22:40:04,575 INFO L124 PetriNetUnfolderBase]: 3/145 cut-off events. [2023-11-06 22:40:04,576 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:40:04,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 3/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 119 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-06 22:40:04,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 149 transitions, 314 flow [2023-11-06 22:40:04,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 145 transitions, 302 flow [2023-11-06 22:40:04,592 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:40:04,608 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 145 transitions, 302 flow [2023-11-06 22:40:04,612 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 145 transitions, 302 flow [2023-11-06 22:40:04,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 145 transitions, 302 flow [2023-11-06 22:40:04,652 INFO L124 PetriNetUnfolderBase]: 3/145 cut-off events. [2023-11-06 22:40:04,653 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:40:04,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 3/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 119 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-06 22:40:04,675 INFO L119 LiptonReduction]: Number of co-enabled transitions 3934 [2023-11-06 22:40:10,433 INFO L134 LiptonReduction]: Checked pairs total: 10024 [2023-11-06 22:40:10,433 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-11-06 22:40:10,451 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:40:10,458 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;@3e574397, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:40:10,458 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:40:10,460 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:40:10,461 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:40:10,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:40:10,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:10,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:40:10,462 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:40:10,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:10,468 INFO L85 PathProgramCache]: Analyzing trace with hash 646, now seen corresponding path program 1 times [2023-11-06 22:40:10,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:10,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523312157] [2023-11-06 22:40:10,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:10,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:10,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:10,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:40:10,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523312157] [2023-11-06 22:40:10,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523312157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:10,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:10,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:40:10,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749828335] [2023-11-06 22:40:10,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:10,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:40:10,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:40:10,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:40:10,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:40:10,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 290 [2023-11-06 22:40:10,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:10,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:10,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 290 [2023-11-06 22:40:10,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:13,298 INFO L124 PetriNetUnfolderBase]: 9959/13395 cut-off events. [2023-11-06 22:40:13,298 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-11-06 22:40:13,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26983 conditions, 13395 events. 9959/13395 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 68865 event pairs, 9959 based on Foata normal form. 400/11893 useless extension candidates. Maximal degree in co-relation 26971. Up to 13371 conditions per place. [2023-11-06 22:40:13,429 INFO L140 encePairwiseOnDemand]: 281/290 looper letters, 29 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-11-06 22:40:13,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 134 flow [2023-11-06 22:40:13,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:40:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:40:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 304 transitions. [2023-11-06 22:40:13,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241379310344828 [2023-11-06 22:40:13,453 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 304 transitions. [2023-11-06 22:40:13,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 304 transitions. [2023-11-06 22:40:13,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:13,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 304 transitions. [2023-11-06 22:40:13,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 152.0) internal successors, (304), 2 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:13,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:13,473 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:13,475 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 304 transitions. [2023-11-06 22:40:13,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 134 flow [2023-11-06 22:40:13,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:40:13,487 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-11-06 22:40:13,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-11-06 22:40:13,494 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-11-06 22:40:13,494 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-11-06 22:40:13,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:13,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:13,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:40:13,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:40:13,496 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:40:13,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash 636946, now seen corresponding path program 1 times [2023-11-06 22:40:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:13,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743712143] [2023-11-06 22:40:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:13,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:13,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:40:13,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743712143] [2023-11-06 22:40:13,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743712143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:13,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:13,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:40:13,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518266153] [2023-11-06 22:40:13,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:13,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:40:13,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:40:13,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:40:13,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:40:13,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 290 [2023-11-06 22:40:13,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:13,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:13,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 290 [2023-11-06 22:40:13,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:15,843 INFO L124 PetriNetUnfolderBase]: 7831/10739 cut-off events. [2023-11-06 22:40:15,844 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:40:15,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21472 conditions, 10739 events. 7831/10739 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 55543 event pairs, 2967 based on Foata normal form. 0/9775 useless extension candidates. Maximal degree in co-relation 21469. Up to 8431 conditions per place. [2023-11-06 22:40:15,937 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 45 selfloop transitions, 2 changer transitions 4/54 dead transitions. [2023-11-06 22:40:15,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 224 flow [2023-11-06 22:40:15,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:40:15,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:40:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2023-11-06 22:40:15,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5149425287356322 [2023-11-06 22:40:15,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2023-11-06 22:40:15,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2023-11-06 22:40:15,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:15,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2023-11-06 22:40:15,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:15,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:15,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:15,955 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 448 transitions. [2023-11-06 22:40:15,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 224 flow [2023-11-06 22:40:15,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:40:15,960 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 70 flow [2023-11-06 22:40:15,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=43, PETRI_TRANSITIONS=29} [2023-11-06 22:40:15,962 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-11-06 22:40:15,962 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 70 flow [2023-11-06 22:40:15,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:15,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:15,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:15,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:40:15,972 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:40:15,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash 122961080, now seen corresponding path program 1 times [2023-11-06 22:40:15,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:15,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392736824] [2023-11-06 22:40:15,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:15,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:17,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:40:17,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392736824] [2023-11-06 22:40:17,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392736824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:17,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:17,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:40:17,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852951974] [2023-11-06 22:40:17,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:17,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:40:17,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:40:17,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:40:17,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:40:17,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 290 [2023-11-06 22:40:17,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:17,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:17,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 290 [2023-11-06 22:40:17,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:19,051 INFO L124 PetriNetUnfolderBase]: 4903/6693 cut-off events. [2023-11-06 22:40:19,051 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2023-11-06 22:40:19,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13982 conditions, 6693 events. 4903/6693 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 32480 event pairs, 1024 based on Foata normal form. 0/6693 useless extension candidates. Maximal degree in co-relation 13978. Up to 6432 conditions per place. [2023-11-06 22:40:19,107 INFO L140 encePairwiseOnDemand]: 285/290 looper letters, 39 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-11-06 22:40:19,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 196 flow [2023-11-06 22:40:19,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:40:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:40:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2023-11-06 22:40:19,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41839080459770117 [2023-11-06 22:40:19,112 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 728 transitions. [2023-11-06 22:40:19,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions. [2023-11-06 22:40:19,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:19,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions. [2023-11-06 22:40:19,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:19,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:19,123 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:19,123 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 70 flow. Second operand 6 states and 728 transitions. [2023-11-06 22:40:19,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 196 flow [2023-11-06 22:40:19,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:40:19,125 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 72 flow [2023-11-06 22:40:19,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2023-11-06 22:40:19,127 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-11-06 22:40:19,127 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 72 flow [2023-11-06 22:40:19,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:19,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:19,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:19,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:40:19,129 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:40:19,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:19,130 INFO L85 PathProgramCache]: Analyzing trace with hash 122961049, now seen corresponding path program 1 times [2023-11-06 22:40:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:19,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707899803] [2023-11-06 22:40:19,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:19,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:19,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:40:19,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707899803] [2023-11-06 22:40:19,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707899803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:19,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:19,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:40:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834688486] [2023-11-06 22:40:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:19,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:40:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:40:19,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:40:19,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:40:19,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 290 [2023-11-06 22:40:19,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:19,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:19,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 290 [2023-11-06 22:40:19,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:22,222 INFO L124 PetriNetUnfolderBase]: 17559/23920 cut-off events. [2023-11-06 22:40:22,222 INFO L125 PetriNetUnfolderBase]: For 221/221 co-relation queries the response was YES. [2023-11-06 22:40:22,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48555 conditions, 23920 events. 17559/23920 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 128864 event pairs, 6103 based on Foata normal form. 988/24908 useless extension candidates. Maximal degree in co-relation 48551. Up to 13876 conditions per place. [2023-11-06 22:40:22,388 INFO L140 encePairwiseOnDemand]: 282/290 looper letters, 45 selfloop transitions, 6 changer transitions 33/84 dead transitions. [2023-11-06 22:40:22,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 360 flow [2023-11-06 22:40:22,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:40:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:40:22,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 686 transitions. [2023-11-06 22:40:22,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731034482758621 [2023-11-06 22:40:22,394 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 686 transitions. [2023-11-06 22:40:22,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 686 transitions. [2023-11-06 22:40:22,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:22,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 686 transitions. [2023-11-06 22:40:22,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:22,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:22,405 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:22,405 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 72 flow. Second operand 5 states and 686 transitions. [2023-11-06 22:40:22,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 84 transitions, 360 flow [2023-11-06 22:40:22,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 84 transitions, 350 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:40:22,410 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 125 flow [2023-11-06 22:40:22,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2023-11-06 22:40:22,411 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2023-11-06 22:40:22,412 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 125 flow [2023-11-06 22:40:22,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:22,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:22,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:22,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:40:22,414 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:40:22,414 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:22,414 INFO L85 PathProgramCache]: Analyzing trace with hash -483202033, now seen corresponding path program 1 times [2023-11-06 22:40:22,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:22,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97668798] [2023-11-06 22:40:22,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:22,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:22,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:40:22,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97668798] [2023-11-06 22:40:22,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97668798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:22,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:22,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:40:22,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180509119] [2023-11-06 22:40:22,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:22,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:40:22,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:40:22,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:40:22,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:40:22,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-11-06 22:40:22,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:22,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:22,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-11-06 22:40:22,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:24,219 INFO L124 PetriNetUnfolderBase]: 7121/10355 cut-off events. [2023-11-06 22:40:24,219 INFO L125 PetriNetUnfolderBase]: For 4275/4532 co-relation queries the response was YES. [2023-11-06 22:40:24,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25446 conditions, 10355 events. 7121/10355 cut-off events. For 4275/4532 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 59191 event pairs, 1748 based on Foata normal form. 304/10353 useless extension candidates. Maximal degree in co-relation 25439. Up to 8839 conditions per place. [2023-11-06 22:40:24,336 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 43 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2023-11-06 22:40:24,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 286 flow [2023-11-06 22:40:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:40:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:40:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-11-06 22:40:24,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49310344827586206 [2023-11-06 22:40:24,340 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-11-06 22:40:24,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-11-06 22:40:24,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:24,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-11-06 22:40:24,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:24,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:24,348 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:24,348 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 125 flow. Second operand 3 states and 429 transitions. [2023-11-06 22:40:24,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 286 flow [2023-11-06 22:40:24,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 268 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:40:24,388 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 144 flow [2023-11-06 22:40:24,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-11-06 22:40:24,390 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -7 predicate places. [2023-11-06 22:40:24,390 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 144 flow [2023-11-06 22:40:24,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:24,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:24,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:24,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:40:24,392 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:40:24,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1990564175, now seen corresponding path program 1 times [2023-11-06 22:40:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:24,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104449966] [2023-11-06 22:40:24,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:24,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:24,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:24,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:40:24,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104449966] [2023-11-06 22:40:24,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104449966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:24,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:24,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:40:24,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532823325] [2023-11-06 22:40:24,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:24,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:40:24,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:40:24,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:40:24,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:40:24,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-11-06 22:40:24,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:24,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:24,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-11-06 22:40:24,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:25,563 INFO L124 PetriNetUnfolderBase]: 3347/5172 cut-off events. [2023-11-06 22:40:25,563 INFO L125 PetriNetUnfolderBase]: For 1718/1832 co-relation queries the response was YES. [2023-11-06 22:40:25,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14159 conditions, 5172 events. 3347/5172 cut-off events. For 1718/1832 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 29394 event pairs, 777 based on Foata normal form. 332/5328 useless extension candidates. Maximal degree in co-relation 14151. Up to 2458 conditions per place. [2023-11-06 22:40:25,602 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 58 selfloop transitions, 9 changer transitions 0/73 dead transitions. [2023-11-06 22:40:25,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 394 flow [2023-11-06 22:40:25,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:40:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:40:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2023-11-06 22:40:25,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49482758620689654 [2023-11-06 22:40:25,607 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 574 transitions. [2023-11-06 22:40:25,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 574 transitions. [2023-11-06 22:40:25,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:25,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 574 transitions. [2023-11-06 22:40:25,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.5) internal successors, (574), 4 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-06 22:40:25,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:25,614 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:25,614 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 144 flow. Second operand 4 states and 574 transitions. [2023-11-06 22:40:25,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 394 flow [2023-11-06 22:40:25,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 73 transitions, 387 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:40:25,619 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 189 flow [2023-11-06 22:40:25,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-11-06 22:40:25,620 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-11-06 22:40:25,621 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 189 flow [2023-11-06 22:40:25,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:25,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:25,621 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-06 22:40:25,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:40:25,622 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:40:25,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:25,623 INFO L85 PathProgramCache]: Analyzing trace with hash -728807891, now seen corresponding path program 1 times [2023-11-06 22:40:25,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:25,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008223496] [2023-11-06 22:40:25,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:25,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:26,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:40:26,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008223496] [2023-11-06 22:40:26,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008223496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:26,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:26,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:40:26,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896504048] [2023-11-06 22:40:26,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:26,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:40:26,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:40:26,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:40:26,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:40:26,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-11-06 22:40:26,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:26,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:26,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-11-06 22:40:26,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:26,633 INFO L124 PetriNetUnfolderBase]: 2351/3619 cut-off events. [2023-11-06 22:40:26,633 INFO L125 PetriNetUnfolderBase]: For 3263/3373 co-relation queries the response was YES. [2023-11-06 22:40:26,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11026 conditions, 3619 events. 2351/3619 cut-off events. For 3263/3373 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 19967 event pairs, 598 based on Foata normal form. 153/3617 useless extension candidates. Maximal degree in co-relation 11018. Up to 1435 conditions per place. [2023-11-06 22:40:26,670 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 71 selfloop transitions, 13 changer transitions 0/90 dead transitions. [2023-11-06 22:40:26,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 90 transitions, 522 flow [2023-11-06 22:40:26,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:40:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:40:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2023-11-06 22:40:26,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49448275862068963 [2023-11-06 22:40:26,674 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 717 transitions. [2023-11-06 22:40:26,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 717 transitions. [2023-11-06 22:40:26,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:26,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 717 transitions. [2023-11-06 22:40:26,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:26,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:26,683 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:26,683 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 189 flow. Second operand 5 states and 717 transitions. [2023-11-06 22:40:26,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 90 transitions, 522 flow [2023-11-06 22:40:26,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 504 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 22:40:26,692 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 239 flow [2023-11-06 22:40:26,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2023-11-06 22:40:26,693 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-11-06 22:40:26,693 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 239 flow [2023-11-06 22:40:26,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:26,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:26,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:26,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:40:26,695 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:40:26,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:26,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1341674443, now seen corresponding path program 1 times [2023-11-06 22:40:26,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:26,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471942661] [2023-11-06 22:40:26,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:26,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:27,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:40:27,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471942661] [2023-11-06 22:40:27,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471942661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:27,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:27,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:40:27,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596596330] [2023-11-06 22:40:27,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:27,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:40:27,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:40:27,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:40:27,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:40:27,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 290 [2023-11-06 22:40:27,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:27,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:27,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 290 [2023-11-06 22:40:27,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:28,083 INFO L124 PetriNetUnfolderBase]: 3693/5762 cut-off events. [2023-11-06 22:40:28,083 INFO L125 PetriNetUnfolderBase]: For 7476/7497 co-relation queries the response was YES. [2023-11-06 22:40:28,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18275 conditions, 5762 events. 3693/5762 cut-off events. For 7476/7497 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 33482 event pairs, 640 based on Foata normal form. 16/5731 useless extension candidates. Maximal degree in co-relation 18266. Up to 2756 conditions per place. [2023-11-06 22:40:28,119 INFO L140 encePairwiseOnDemand]: 286/290 looper letters, 67 selfloop transitions, 2 changer transitions 39/112 dead transitions. [2023-11-06 22:40:28,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 112 transitions, 817 flow [2023-11-06 22:40:28,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:40:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:40:28,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2023-11-06 22:40:28,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772413793103448 [2023-11-06 22:40:28,124 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 692 transitions. [2023-11-06 22:40:28,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 692 transitions. [2023-11-06 22:40:28,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:28,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 692 transitions. [2023-11-06 22:40:28,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:28,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:28,132 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:28,132 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 239 flow. Second operand 5 states and 692 transitions. [2023-11-06 22:40:28,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 112 transitions, 817 flow [2023-11-06 22:40:28,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 112 transitions, 727 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-11-06 22:40:28,209 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 226 flow [2023-11-06 22:40:28,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-06 22:40:28,210 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-11-06 22:40:28,210 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 226 flow [2023-11-06 22:40:28,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:28,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:28,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:28,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:40:28,211 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:40:28,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:28,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1121024539, now seen corresponding path program 2 times [2023-11-06 22:40:28,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:28,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805534770] [2023-11-06 22:40:28,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:28,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:28,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:40:28,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805534770] [2023-11-06 22:40:28,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805534770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:28,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:28,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:40:28,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879680711] [2023-11-06 22:40:28,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:28,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:40:28,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:40:28,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:40:28,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:40:28,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-11-06 22:40:28,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:28,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:28,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-11-06 22:40:28,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:29,428 INFO L124 PetriNetUnfolderBase]: 3311/5069 cut-off events. [2023-11-06 22:40:29,429 INFO L125 PetriNetUnfolderBase]: For 4228/4342 co-relation queries the response was YES. [2023-11-06 22:40:29,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15066 conditions, 5069 events. 3311/5069 cut-off events. For 4228/4342 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 30048 event pairs, 801 based on Foata normal form. 53/4912 useless extension candidates. Maximal degree in co-relation 15054. Up to 2112 conditions per place. [2023-11-06 22:40:29,461 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 64 selfloop transitions, 17 changer transitions 4/91 dead transitions. [2023-11-06 22:40:29,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 91 transitions, 544 flow [2023-11-06 22:40:29,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:40:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:40:29,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions. [2023-11-06 22:40:29,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48563218390804597 [2023-11-06 22:40:29,466 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 845 transitions. [2023-11-06 22:40:29,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 845 transitions. [2023-11-06 22:40:29,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:29,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 845 transitions. [2023-11-06 22:40:29,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:29,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:29,476 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:29,476 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 226 flow. Second operand 6 states and 845 transitions. [2023-11-06 22:40:29,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 91 transitions, 544 flow [2023-11-06 22:40:29,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 536 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-06 22:40:29,629 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 255 flow [2023-11-06 22:40:29,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2023-11-06 22:40:29,630 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2023-11-06 22:40:29,630 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 255 flow [2023-11-06 22:40:29,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:29,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:29,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:29,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:40:29,632 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:40:29,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1204542368, now seen corresponding path program 1 times [2023-11-06 22:40:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:29,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70067696] [2023-11-06 22:40:29,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:29,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:40:29,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70067696] [2023-11-06 22:40:29,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70067696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:29,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:29,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:40:29,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532940841] [2023-11-06 22:40:29,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:29,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:40:29,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:40:29,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:40:29,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:40:30,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 290 [2023-11-06 22:40:30,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:30,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:30,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 290 [2023-11-06 22:40:30,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:30,988 INFO L124 PetriNetUnfolderBase]: 3276/5009 cut-off events. [2023-11-06 22:40:30,988 INFO L125 PetriNetUnfolderBase]: For 7239/7250 co-relation queries the response was YES. [2023-11-06 22:40:31,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16638 conditions, 5009 events. 3276/5009 cut-off events. For 7239/7250 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 27500 event pairs, 957 based on Foata normal form. 1/4946 useless extension candidates. Maximal degree in co-relation 16626. Up to 2039 conditions per place. [2023-11-06 22:40:31,021 INFO L140 encePairwiseOnDemand]: 286/290 looper letters, 53 selfloop transitions, 1 changer transitions 33/91 dead transitions. [2023-11-06 22:40:31,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 714 flow [2023-11-06 22:40:31,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:40:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:40:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2023-11-06 22:40:31,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4627586206896552 [2023-11-06 22:40:31,026 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2023-11-06 22:40:31,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2023-11-06 22:40:31,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:31,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2023-11-06 22:40:31,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:31,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:31,035 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:31,035 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 255 flow. Second operand 5 states and 671 transitions. [2023-11-06 22:40:31,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 91 transitions, 714 flow [2023-11-06 22:40:31,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 581 flow, removed 34 selfloop flow, removed 6 redundant places. [2023-11-06 22:40:31,122 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 202 flow [2023-11-06 22:40:31,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2023-11-06 22:40:31,124 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2023-11-06 22:40:31,124 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 202 flow [2023-11-06 22:40:31,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:31,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:31,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:31,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:40:31,125 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:40:31,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:31,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1132012236, now seen corresponding path program 2 times [2023-11-06 22:40:31,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:31,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321360331] [2023-11-06 22:40:31,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:31,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:32,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:40:32,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321360331] [2023-11-06 22:40:32,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321360331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:32,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:32,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:40:32,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720756778] [2023-11-06 22:40:32,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:32,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:40:32,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:40:32,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:40:32,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:40:32,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 290 [2023-11-06 22:40:32,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 202 flow. Second operand has 9 states, 9 states have (on average 124.77777777777777) internal successors, (1123), 9 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:32,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:32,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 290 [2023-11-06 22:40:32,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:33,511 INFO L124 PetriNetUnfolderBase]: 2286/3831 cut-off events. [2023-11-06 22:40:33,511 INFO L125 PetriNetUnfolderBase]: For 3159/3168 co-relation queries the response was YES. [2023-11-06 22:40:33,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11354 conditions, 3831 events. 2286/3831 cut-off events. For 3159/3168 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 23689 event pairs, 245 based on Foata normal form. 5/3777 useless extension candidates. Maximal degree in co-relation 11341. Up to 1971 conditions per place. [2023-11-06 22:40:33,535 INFO L140 encePairwiseOnDemand]: 283/290 looper letters, 67 selfloop transitions, 4 changer transitions 36/113 dead transitions. [2023-11-06 22:40:33,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 113 transitions, 732 flow [2023-11-06 22:40:33,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:40:33,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:40:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1045 transitions. [2023-11-06 22:40:33,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4504310344827586 [2023-11-06 22:40:33,542 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1045 transitions. [2023-11-06 22:40:33,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1045 transitions. [2023-11-06 22:40:33,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:33,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1045 transitions. [2023-11-06 22:40:33,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.625) internal successors, (1045), 8 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:33,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 290.0) internal successors, (2610), 9 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:33,554 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 290.0) internal successors, (2610), 9 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:33,554 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 202 flow. Second operand 8 states and 1045 transitions. [2023-11-06 22:40:33,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 113 transitions, 732 flow [2023-11-06 22:40:33,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 113 transitions, 723 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 22:40:33,617 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 215 flow [2023-11-06 22:40:33,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=215, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2023-11-06 22:40:33,618 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 10 predicate places. [2023-11-06 22:40:33,618 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 215 flow [2023-11-06 22:40:33,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 124.77777777777777) internal successors, (1123), 9 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:33,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:33,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:33,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:40:33,620 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:40:33,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:33,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2117065600, now seen corresponding path program 3 times [2023-11-06 22:40:33,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:33,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010975571] [2023-11-06 22:40:33,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:33,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:40:33,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:40:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:40:33,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:40:33,828 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:40:33,829 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:40:33,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:40:33,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:40:33,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:40:33,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:40:33,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:40:33,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:40:33,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:40:33,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:40:33,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:40:33,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:40:33,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:40:33,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:40:33,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:40:33,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:40:33,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:40:33,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:40:33,836 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:33,842 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:40:33,843 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:40:33,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:40:33 BasicIcfg [2023-11-06 22:40:33,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:40:33,950 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:40:33,950 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:40:33,950 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:40:33,951 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:40:04" (3/4) ... [2023-11-06 22:40:33,953 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:40:33,954 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:40:33,955 INFO L158 Benchmark]: Toolchain (without parser) took 31336.83ms. Allocated memory was 169.9MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 126.4MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 580.6MB. Max. memory is 16.1GB. [2023-11-06 22:40:33,955 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 119.5MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:40:33,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 689.34ms. Allocated memory is still 169.9MB. Free memory was 125.9MB in the beginning and 101.8MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:40:33,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.06ms. Allocated memory is still 169.9MB. Free memory was 101.8MB in the beginning and 99.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:40:33,959 INFO L158 Benchmark]: Boogie Preprocessor took 74.41ms. Allocated memory is still 169.9MB. Free memory was 99.5MB in the beginning and 97.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:40:33,959 INFO L158 Benchmark]: RCFGBuilder took 840.62ms. Allocated memory is still 169.9MB. Free memory was 97.1MB in the beginning and 105.6MB in the end (delta: -8.6MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2023-11-06 22:40:33,960 INFO L158 Benchmark]: TraceAbstraction took 29607.28ms. Allocated memory was 169.9MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 104.3MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 555.7MB. Max. memory is 16.1GB. [2023-11-06 22:40:33,960 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 3.9GB. Free memory is still 3.3GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:40:33,962 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.45ms. Allocated memory is still 119.5MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 689.34ms. Allocated memory is still 169.9MB. Free memory was 125.9MB in the beginning and 101.8MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.06ms. Allocated memory is still 169.9MB. Free memory was 101.8MB in the beginning and 99.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.41ms. Allocated memory is still 169.9MB. Free memory was 99.5MB in the beginning and 97.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 840.62ms. Allocated memory is still 169.9MB. Free memory was 97.1MB in the beginning and 105.6MB in the end (delta: -8.6MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * TraceAbstraction took 29607.28ms. Allocated memory was 169.9MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 104.3MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 555.7MB. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 3.9GB. Free memory is still 3.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 155 PlacesBefore, 53 PlacesAfterwards, 145 TransitionsBefore, 41 TransitionsAfterwards, 3934 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 141 TotalNumberOfCompositions, 10024 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4108, independent: 3902, independent conditional: 0, independent unconditional: 3902, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2021, independent: 1980, independent conditional: 0, independent unconditional: 1980, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4108, independent: 1922, independent conditional: 0, independent unconditional: 1922, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 2021, unknown conditional: 0, unknown unconditional: 2021] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L861] 0 pthread_t t1353; [L862] FCALL, FORK 0 pthread_create(&t1353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1353, ((void *)0), P0, ((void *)0))=-3, t1353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1354; [L864] FCALL, FORK 0 pthread_create(&t1354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1354, ((void *)0), P1, ((void *)0))=-2, t1353={5:0}, t1354={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1355; [L866] FCALL, FORK 0 pthread_create(&t1355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1355, ((void *)0), P2, ((void *)0))=-1, t1353={5:0}, t1354={6:0}, t1355={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t1356; [L868] FCALL, FORK 0 pthread_create(&t1356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1356, ((void *)0), P3, ((void *)0))=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L830] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L831] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 4 return 0; [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L881] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 866]: 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: 862]: 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: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 29.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 633 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 523 mSDsluCounter, 303 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 274 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1670 IncrementalHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 29 mSDtfsCounter, 1670 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255occurred in iteration=9, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 1192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:40:33,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:40:36,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:40:37,030 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:40:37,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:40:37,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:40:37,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:40:37,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:40:37,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:40:37,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:40:37,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:40:37,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:40:37,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:40:37,104 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:40:37,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:40:37,107 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:40:37,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:40:37,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:40:37,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:40:37,109 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:40:37,111 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:40:37,111 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:40:37,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:40:37,112 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:40:37,113 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:40:37,113 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:40:37,114 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:40:37,114 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:40:37,115 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:40:37,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:40:37,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:40:37,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:40:37,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:40:37,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:40:37,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:40:37,120 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:40:37,120 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:40:37,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:40:37,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:40:37,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:40:37,122 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:40:37,123 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:40:37,123 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_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 [2023-11-06 22:40:37,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:40:37,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:40:37,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:40:37,652 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:40:37,652 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:40:37,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-06 22:40:41,172 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:40:41,549 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:40:41,550 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-06 22:40:41,570 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/data/fc4fd904c/406c8669bc764a31b2a22586a65152cf/FLAGcc9e8cec3 [2023-11-06 22:40:41,589 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/data/fc4fd904c/406c8669bc764a31b2a22586a65152cf [2023-11-06 22:40:41,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:40:41,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:40:41,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:40:41,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:40:41,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:40:41,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:40:41" (1/1) ... [2023-11-06 22:40:41,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a0eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:41, skipping insertion in model container [2023-11-06 22:40:41,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:40:41" (1/1) ... [2023-11-06 22:40:41,698 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:40:42,302 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:40:42,357 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:40:42,486 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:40:42,539 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:40:42,540 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:40:42,548 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:40:42,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42 WrapperNode [2023-11-06 22:40:42,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:40:42,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:40:42,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:40:42,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:40:42,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,600 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,637 INFO L138 Inliner]: procedures = 180, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-06 22:40:42,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:40:42,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:40:42,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:40:42,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:40:42,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:40:42,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:40:42,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:40:42,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:40:42,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:40:42,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:42,740 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:42,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:40:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:40:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:40:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:40:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:40:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:40:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:40:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:40:42,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:40:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:40:42,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:40:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:40:42,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:40:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:40:42,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:40:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:40:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:40:42,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:40:42,781 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:40:42,965 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:40:42,968 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:40:43,574 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:40:43,759 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:40:43,760 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:40:43,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:40:43 BoogieIcfgContainer [2023-11-06 22:40:43,764 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:40:43,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:40:43,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:40:43,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:40:43,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:40:41" (1/3) ... [2023-11-06 22:40:43,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784dcd46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:40:43, skipping insertion in model container [2023-11-06 22:40:43,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (2/3) ... [2023-11-06 22:40:43,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784dcd46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:40:43, skipping insertion in model container [2023-11-06 22:40:43,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:40:43" (3/3) ... [2023-11-06 22:40:43,796 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-06 22:40:43,817 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:40:43,817 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:40:43,818 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:40:43,914 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:40:43,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 22:40:44,029 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 22:40:44,029 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:40:44,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 119 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-06 22:40:44,036 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 22:40:44,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 146 transitions, 304 flow [2023-11-06 22:40:44,047 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:40:44,058 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-06 22:40:44,062 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-06 22:40:44,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 304 flow [2023-11-06 22:40:44,104 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 22:40:44,104 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:40:44,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 120 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-06 22:40:44,110 INFO L119 LiptonReduction]: Number of co-enabled transitions 3934 [2023-11-06 22:40:54,555 INFO L134 LiptonReduction]: Checked pairs total: 10748 [2023-11-06 22:40:54,555 INFO L136 LiptonReduction]: Total number of compositions: 137 [2023-11-06 22:40:54,570 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:40:54,577 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;@512e658d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:40:54,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:40:54,579 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:40:54,579 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:40:54,579 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:40:54,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:54,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:40:54,581 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:40:54,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:54,586 INFO L85 PathProgramCache]: Analyzing trace with hash 645, now seen corresponding path program 1 times [2023-11-06 22:40:54,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:54,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538366182] [2023-11-06 22:40:54,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:54,600 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-06 22:40:54,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:54,612 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:40:54,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:40:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:54,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:40:54,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:54,725 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:40:54,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:54,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538366182] [2023-11-06 22:40:54,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538366182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:54,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:54,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:40:54,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067042627] [2023-11-06 22:40:54,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:54,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:40:54,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:54,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:40:54,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:40:54,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 287 [2023-11-06 22:40:54,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:54,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:54,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 287 [2023-11-06 22:40:54,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:57,406 INFO L124 PetriNetUnfolderBase]: 9959/13405 cut-off events. [2023-11-06 22:40:57,407 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-06 22:40:57,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26993 conditions, 13405 events. 9959/13405 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 69180 event pairs, 9959 based on Foata normal form. 400/11892 useless extension candidates. Maximal degree in co-relation 26981. Up to 13371 conditions per place. [2023-11-06 22:40:57,545 INFO L140 encePairwiseOnDemand]: 278/287 looper letters, 29 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-11-06 22:40:57,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 134 flow [2023-11-06 22:40:57,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:40:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:40:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 306 transitions. [2023-11-06 22:40:57,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5331010452961672 [2023-11-06 22:40:57,568 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 306 transitions. [2023-11-06 22:40:57,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 306 transitions. [2023-11-06 22:40:57,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:57,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 306 transitions. [2023-11-06 22:40:57,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:57,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:57,591 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:57,592 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 306 transitions. [2023-11-06 22:40:57,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 134 flow [2023-11-06 22:40:57,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:40:57,603 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-11-06 22:40:57,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-11-06 22:40:57,612 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-11-06 22:40:57,612 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-11-06 22:40:57,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:57,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:57,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:40:57,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:57,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:40:57,825 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:40:57,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:57,837 INFO L85 PathProgramCache]: Analyzing trace with hash 634199, now seen corresponding path program 1 times [2023-11-06 22:40:57,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:57,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297834612] [2023-11-06 22:40:57,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:57,842 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-06 22:40:57,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:57,843 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:40:57,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:40:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:57,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:40:57,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:57,975 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:40:57,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:57,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297834612] [2023-11-06 22:40:57,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297834612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:57,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:57,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:40:57,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658019650] [2023-11-06 22:40:57,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:57,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:40:57,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:57,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:40:57,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:40:57,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 287 [2023-11-06 22:40:57,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:40:57,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:57,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 287 [2023-11-06 22:40:57,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:59,932 INFO L124 PetriNetUnfolderBase]: 7831/11249 cut-off events. [2023-11-06 22:40:59,933 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:40:59,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21982 conditions, 11249 events. 7831/11249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 68790 event pairs, 1447 based on Foata normal form. 0/10283 useless extension candidates. Maximal degree in co-relation 21979. Up to 8431 conditions per place. [2023-11-06 22:41:00,026 INFO L140 encePairwiseOnDemand]: 284/287 looper letters, 45 selfloop transitions, 2 changer transitions 4/54 dead transitions. [2023-11-06 22:41:00,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 224 flow [2023-11-06 22:41:00,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:41:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:41:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2023-11-06 22:41:00,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2023-11-06 22:41:00,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2023-11-06 22:41:00,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2023-11-06 22:41:00,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:00,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2023-11-06 22:41:00,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:00,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:00,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:00,039 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 451 transitions. [2023-11-06 22:41:00,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 224 flow [2023-11-06 22:41:00,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:41:00,042 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 70 flow [2023-11-06 22:41:00,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=43, PETRI_TRANSITIONS=29} [2023-11-06 22:41:00,044 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-11-06 22:41:00,044 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 70 flow [2023-11-06 22:41:00,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:00,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:41:00,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:00,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:00,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:00,258 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:41:00,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:00,259 INFO L85 PathProgramCache]: Analyzing trace with hash 2131705987, now seen corresponding path program 1 times [2023-11-06 22:41:00,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:00,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719774533] [2023-11-06 22:41:00,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:00,261 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-06 22:41:00,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:00,262 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:00,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:00,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:41:00,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:00,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:00,460 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:00,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:00,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719774533] [2023-11-06 22:41:00,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719774533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:00,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:00,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:41:00,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490874046] [2023-11-06 22:41:00,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:00,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:41:00,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:41:00,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:41:00,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:41:00,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 287 [2023-11-06 22:41:00,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:00,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:41:00,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 287 [2023-11-06 22:41:00,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:41:01,454 INFO L124 PetriNetUnfolderBase]: 3719/5290 cut-off events. [2023-11-06 22:41:01,455 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2023-11-06 22:41:01,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11075 conditions, 5290 events. 3719/5290 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 26771 event pairs, 803 based on Foata normal form. 108/5171 useless extension candidates. Maximal degree in co-relation 11071. Up to 4756 conditions per place. [2023-11-06 22:41:01,504 INFO L140 encePairwiseOnDemand]: 281/287 looper letters, 40 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-11-06 22:41:01,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 206 flow [2023-11-06 22:41:01,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:41:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:41:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-11-06 22:41:01,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502903600464576 [2023-11-06 22:41:01,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-11-06 22:41:01,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-11-06 22:41:01,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:01,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-11-06 22:41:01,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:01,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:01,515 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:01,515 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 70 flow. Second operand 3 states and 433 transitions. [2023-11-06 22:41:01,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 206 flow [2023-11-06 22:41:01,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:41:01,518 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 99 flow [2023-11-06 22:41:01,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-11-06 22:41:01,520 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-11-06 22:41:01,521 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 99 flow [2023-11-06 22:41:01,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:01,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:41:01,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:01,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:01,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:01,740 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:41:01,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:01,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1325256355, now seen corresponding path program 1 times [2023-11-06 22:41:01,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:01,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90271918] [2023-11-06 22:41:01,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:01,741 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-06 22:41:01,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:01,743 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:01,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:01,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:41:01,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:01,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:01,974 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:01,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:01,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90271918] [2023-11-06 22:41:01,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90271918] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:01,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:01,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:41:01,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818857406] [2023-11-06 22:41:01,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:01,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:41:01,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:41:01,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:41:01,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:41:02,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 287 [2023-11-06 22:41:02,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:02,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:41:02,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 287 [2023-11-06 22:41:02,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:41:02,778 INFO L124 PetriNetUnfolderBase]: 1694/2590 cut-off events. [2023-11-06 22:41:02,778 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2023-11-06 22:41:02,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6247 conditions, 2590 events. 1694/2590 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 12846 event pairs, 402 based on Foata normal form. 135/2633 useless extension candidates. Maximal degree in co-relation 6242. Up to 1426 conditions per place. [2023-11-06 22:41:02,806 INFO L140 encePairwiseOnDemand]: 281/287 looper letters, 53 selfloop transitions, 9 changer transitions 0/65 dead transitions. [2023-11-06 22:41:02,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 65 transitions, 305 flow [2023-11-06 22:41:02,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:41:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:41:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2023-11-06 22:41:02,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043554006968641 [2023-11-06 22:41:02,812 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2023-11-06 22:41:02,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2023-11-06 22:41:02,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:02,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2023-11-06 22:41:02,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:02,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 287.0) internal successors, (1435), 5 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:02,822 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 287.0) internal successors, (1435), 5 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:02,823 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 99 flow. Second operand 4 states and 579 transitions. [2023-11-06 22:41:02,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 65 transitions, 305 flow [2023-11-06 22:41:02,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:41:02,827 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 146 flow [2023-11-06 22:41:02,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-11-06 22:41:02,829 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2023-11-06 22:41:02,829 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 146 flow [2023-11-06 22:41:02,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:02,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:41:02,830 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-06 22:41:02,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-06 22:41:03,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:03,045 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:41:03,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:03,046 INFO L85 PathProgramCache]: Analyzing trace with hash -988813749, now seen corresponding path program 1 times [2023-11-06 22:41:03,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:03,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898715445] [2023-11-06 22:41:03,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:03,047 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-06 22:41:03,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:03,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:03,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:03,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:41:03,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:03,365 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:03,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:03,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898715445] [2023-11-06 22:41:03,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898715445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:03,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:03,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:41:03,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905832268] [2023-11-06 22:41:03,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:03,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:41:03,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:41:03,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:41:03,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:41:03,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 287 [2023-11-06 22:41:03,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:03,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:41:03,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 287 [2023-11-06 22:41:03,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:41:03,992 INFO L124 PetriNetUnfolderBase]: 1064/1645 cut-off events. [2023-11-06 22:41:03,992 INFO L125 PetriNetUnfolderBase]: For 1119/1119 co-relation queries the response was YES. [2023-11-06 22:41:03,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4516 conditions, 1645 events. 1064/1645 cut-off events. For 1119/1119 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7669 event pairs, 331 based on Foata normal form. 63/1679 useless extension candidates. Maximal degree in co-relation 4510. Up to 630 conditions per place. [2023-11-06 22:41:04,007 INFO L140 encePairwiseOnDemand]: 281/287 looper letters, 64 selfloop transitions, 13 changer transitions 0/80 dead transitions. [2023-11-06 22:41:04,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 80 transitions, 414 flow [2023-11-06 22:41:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:41:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:41:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2023-11-06 22:41:04,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5038327526132405 [2023-11-06 22:41:04,012 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2023-11-06 22:41:04,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2023-11-06 22:41:04,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:04,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2023-11-06 22:41:04,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.6) internal successors, (723), 5 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:04,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 287.0) internal successors, (1722), 6 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:04,021 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 287.0) internal successors, (1722), 6 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:04,022 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 146 flow. Second operand 5 states and 723 transitions. [2023-11-06 22:41:04,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 80 transitions, 414 flow [2023-11-06 22:41:04,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 80 transitions, 396 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 22:41:04,035 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 196 flow [2023-11-06 22:41:04,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-11-06 22:41:04,039 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-11-06 22:41:04,039 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 196 flow [2023-11-06 22:41:04,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:04,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:41:04,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:04,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:04,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:04,256 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:41:04,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:04,257 INFO L85 PathProgramCache]: Analyzing trace with hash 180358673, now seen corresponding path program 1 times [2023-11-06 22:41:04,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:04,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837371548] [2023-11-06 22:41:04,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:04,258 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-06 22:41:04,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:04,260 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:04,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:04,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:41:04,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:04,539 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:04,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:04,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837371548] [2023-11-06 22:41:04,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837371548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:04,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:04,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:41:04,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984569510] [2023-11-06 22:41:04,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:04,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:41:04,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:41:04,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:41:04,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:41:04,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 287 [2023-11-06 22:41:04,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:04,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:41:04,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 287 [2023-11-06 22:41:04,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:41:05,288 INFO L124 PetriNetUnfolderBase]: 999/1515 cut-off events. [2023-11-06 22:41:05,291 INFO L125 PetriNetUnfolderBase]: For 1282/1282 co-relation queries the response was YES. [2023-11-06 22:41:05,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4323 conditions, 1515 events. 999/1515 cut-off events. For 1282/1282 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7066 event pairs, 326 based on Foata normal form. 13/1512 useless extension candidates. Maximal degree in co-relation 4316. Up to 630 conditions per place. [2023-11-06 22:41:05,306 INFO L140 encePairwiseOnDemand]: 281/287 looper letters, 60 selfloop transitions, 17 changer transitions 0/80 dead transitions. [2023-11-06 22:41:05,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 80 transitions, 440 flow [2023-11-06 22:41:05,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:41:05,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:41:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 852 transitions. [2023-11-06 22:41:05,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49477351916376305 [2023-11-06 22:41:05,312 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 852 transitions. [2023-11-06 22:41:05,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 852 transitions. [2023-11-06 22:41:05,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:05,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 852 transitions. [2023-11-06 22:41:05,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:05,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 287.0) internal successors, (2009), 7 states have internal predecessors, (2009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:05,324 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 287.0) internal successors, (2009), 7 states have internal predecessors, (2009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:05,324 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 196 flow. Second operand 6 states and 852 transitions. [2023-11-06 22:41:05,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 80 transitions, 440 flow [2023-11-06 22:41:05,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 80 transitions, 406 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-06 22:41:05,352 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 206 flow [2023-11-06 22:41:05,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-06 22:41:05,356 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-11-06 22:41:05,357 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 206 flow [2023-11-06 22:41:05,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:05,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:41:05,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:05,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:05,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:05,575 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:41:05,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:05,576 INFO L85 PathProgramCache]: Analyzing trace with hash 634700348, now seen corresponding path program 1 times [2023-11-06 22:41:05,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:05,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316794807] [2023-11-06 22:41:05,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:05,578 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-06 22:41:05,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:05,579 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:05,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:05,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:41:05,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:06,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:06,635 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:06,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:06,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316794807] [2023-11-06 22:41:06,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316794807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:06,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:06,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:41:06,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720584387] [2023-11-06 22:41:06,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:06,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:41:06,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:41:06,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:41:06,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:41:06,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 287 [2023-11-06 22:41:06,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 206 flow. Second operand has 9 states, 9 states have (on average 126.77777777777777) internal successors, (1141), 9 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:06,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:41:06,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 287 [2023-11-06 22:41:06,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:41:07,695 INFO L124 PetriNetUnfolderBase]: 1159/1794 cut-off events. [2023-11-06 22:41:07,696 INFO L125 PetriNetUnfolderBase]: For 1915/1915 co-relation queries the response was YES. [2023-11-06 22:41:07,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5317 conditions, 1794 events. 1159/1794 cut-off events. For 1915/1915 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8600 event pairs, 166 based on Foata normal form. 0/1787 useless extension candidates. Maximal degree in co-relation 5309. Up to 773 conditions per place. [2023-11-06 22:41:07,710 INFO L140 encePairwiseOnDemand]: 279/287 looper letters, 99 selfloop transitions, 8 changer transitions 0/110 dead transitions. [2023-11-06 22:41:07,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 110 transitions, 784 flow [2023-11-06 22:41:07,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:41:07,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:41:07,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1064 transitions. [2023-11-06 22:41:07,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2023-11-06 22:41:07,715 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1064 transitions. [2023-11-06 22:41:07,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1064 transitions. [2023-11-06 22:41:07,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:07,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1064 transitions. [2023-11-06 22:41:07,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:07,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 287.0) internal successors, (2583), 9 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:07,725 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 287.0) internal successors, (2583), 9 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:07,725 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 206 flow. Second operand 8 states and 1064 transitions. [2023-11-06 22:41:07,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 110 transitions, 784 flow [2023-11-06 22:41:07,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 110 transitions, 656 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-11-06 22:41:07,746 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 196 flow [2023-11-06 22:41:07,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=196, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-11-06 22:41:07,747 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2023-11-06 22:41:07,747 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 196 flow [2023-11-06 22:41:07,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 126.77777777777777) internal successors, (1141), 9 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:07,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:41:07,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:07,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:07,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:07,967 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:41:07,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:07,967 INFO L85 PathProgramCache]: Analyzing trace with hash 857646690, now seen corresponding path program 2 times [2023-11-06 22:41:07,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:07,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284957412] [2023-11-06 22:41:07,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:41:07,968 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-06 22:41:07,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:07,971 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:07,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:08,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:41:08,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:41:08,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:41:08,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:08,219 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:08,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:08,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284957412] [2023-11-06 22:41:08,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284957412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:08,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:08,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:41:08,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061772876] [2023-11-06 22:41:08,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:08,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:41:08,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:41:08,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:41:08,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:41:08,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 287 [2023-11-06 22:41:08,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:08,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:41:08,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 287 [2023-11-06 22:41:08,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:41:08,910 INFO L124 PetriNetUnfolderBase]: 2066/3183 cut-off events. [2023-11-06 22:41:08,910 INFO L125 PetriNetUnfolderBase]: For 2483/2483 co-relation queries the response was YES. [2023-11-06 22:41:08,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9157 conditions, 3183 events. 2066/3183 cut-off events. For 2483/2483 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 17513 event pairs, 858 based on Foata normal form. 0/3157 useless extension candidates. Maximal degree in co-relation 9146. Up to 1777 conditions per place. [2023-11-06 22:41:08,943 INFO L140 encePairwiseOnDemand]: 282/287 looper letters, 75 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2023-11-06 22:41:08,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 530 flow [2023-11-06 22:41:08,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:41:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:41:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2023-11-06 22:41:08,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48606271777003485 [2023-11-06 22:41:08,948 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 558 transitions. [2023-11-06 22:41:08,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 558 transitions. [2023-11-06 22:41:08,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:08,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 558 transitions. [2023-11-06 22:41:08,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:08,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 287.0) internal successors, (1435), 5 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:08,955 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 287.0) internal successors, (1435), 5 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:08,955 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 196 flow. Second operand 4 states and 558 transitions. [2023-11-06 22:41:08,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 530 flow [2023-11-06 22:41:09,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 522 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:41:09,032 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 246 flow [2023-11-06 22:41:09,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2023-11-06 22:41:09,033 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2023-11-06 22:41:09,034 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 246 flow [2023-11-06 22:41:09,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:09,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:41:09,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:09,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-06 22:41:09,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:09,250 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:41:09,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1843346812, now seen corresponding path program 1 times [2023-11-06 22:41:09,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:09,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252181933] [2023-11-06 22:41:09,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:09,252 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-06 22:41:09,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:09,255 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:09,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:09,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:41:09,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:11,332 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:11,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:11,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252181933] [2023-11-06 22:41:11,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252181933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:11,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:11,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:41:11,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845842898] [2023-11-06 22:41:11,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:11,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:41:11,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:41:11,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:41:11,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:41:12,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 287 [2023-11-06 22:41:12,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:12,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:41:12,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 287 [2023-11-06 22:41:12,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:41:13,112 INFO L124 PetriNetUnfolderBase]: 1816/2780 cut-off events. [2023-11-06 22:41:13,112 INFO L125 PetriNetUnfolderBase]: For 2325/2325 co-relation queries the response was YES. [2023-11-06 22:41:13,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8340 conditions, 2780 events. 1816/2780 cut-off events. For 2325/2325 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 14888 event pairs, 143 based on Foata normal form. 3/2783 useless extension candidates. Maximal degree in co-relation 8327. Up to 2393 conditions per place. [2023-11-06 22:41:13,133 INFO L140 encePairwiseOnDemand]: 282/287 looper letters, 47 selfloop transitions, 4 changer transitions 20/74 dead transitions. [2023-11-06 22:41:13,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 484 flow [2023-11-06 22:41:13,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:41:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:41:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 722 transitions. [2023-11-06 22:41:13,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41927990708478513 [2023-11-06 22:41:13,139 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 722 transitions. [2023-11-06 22:41:13,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 722 transitions. [2023-11-06 22:41:13,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:13,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 722 transitions. [2023-11-06 22:41:13,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:13,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 287.0) internal successors, (2009), 7 states have internal predecessors, (2009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:13,149 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 287.0) internal successors, (2009), 7 states have internal predecessors, (2009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:13,150 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 246 flow. Second operand 6 states and 722 transitions. [2023-11-06 22:41:13,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 484 flow [2023-11-06 22:41:13,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 74 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:41:13,190 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 180 flow [2023-11-06 22:41:13,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2023-11-06 22:41:13,192 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2023-11-06 22:41:13,192 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 180 flow [2023-11-06 22:41:13,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:41:13,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:41:13,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:13,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:13,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:13,407 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:41:13,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:13,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1801002846, now seen corresponding path program 3 times [2023-11-06 22:41:13,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:13,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249903722] [2023-11-06 22:41:13,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:41:13,409 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-06 22:41:13,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:13,411 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:13,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:13,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:41:13,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:41:13,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:13,892 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:41:13,893 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:41:13,894 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:41:13,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:41:13,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:41:13,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:41:13,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:41:13,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:41:13,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:41:13,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:41:13,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:41:13,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:41:13,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:41:13,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:41:13,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:41:13,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:41:13,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:41:13,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:41:13,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:14,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:41:14,121 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:14,127 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:41:14,127 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:41:14,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:41:14 BasicIcfg [2023-11-06 22:41:14,272 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:41:14,273 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:41:14,273 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:41:14,273 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:41:14,274 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:40:43" (3/4) ... [2023-11-06 22:41:14,276 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:41:14,277 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:41:14,278 INFO L158 Benchmark]: Toolchain (without parser) took 32683.47ms. Allocated memory was 77.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 52.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 377.3MB. Max. memory is 16.1GB. [2023-11-06 22:41:14,278 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 77.6MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:41:14,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 954.11ms. Allocated memory was 77.6MB in the beginning and 104.9MB in the end (delta: 27.3MB). Free memory was 52.0MB in the beginning and 73.3MB in the end (delta: -21.3MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-11-06 22:41:14,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.07ms. Allocated memory is still 104.9MB. Free memory was 73.3MB in the beginning and 70.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:41:14,283 INFO L158 Benchmark]: Boogie Preprocessor took 47.13ms. Allocated memory is still 104.9MB. Free memory was 70.7MB in the beginning and 68.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:41:14,284 INFO L158 Benchmark]: RCFGBuilder took 1077.41ms. Allocated memory is still 104.9MB. Free memory was 68.3MB in the beginning and 48.9MB in the end (delta: 19.4MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2023-11-06 22:41:14,284 INFO L158 Benchmark]: TraceAbstraction took 30488.82ms. Allocated memory was 104.9MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 79.7MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 376.3MB. Max. memory is 16.1GB. [2023-11-06 22:41:14,285 INFO L158 Benchmark]: Witness Printer took 4.48ms. Allocated memory is still 2.1GB. Free memory is still 1.7GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:41:14,287 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.38ms. Allocated memory is still 77.6MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 954.11ms. Allocated memory was 77.6MB in the beginning and 104.9MB in the end (delta: 27.3MB). Free memory was 52.0MB in the beginning and 73.3MB in the end (delta: -21.3MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.07ms. Allocated memory is still 104.9MB. Free memory was 73.3MB in the beginning and 70.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.13ms. Allocated memory is still 104.9MB. Free memory was 70.7MB in the beginning and 68.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1077.41ms. Allocated memory is still 104.9MB. Free memory was 68.3MB in the beginning and 48.9MB in the end (delta: 19.4MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * TraceAbstraction took 30488.82ms. Allocated memory was 104.9MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 79.7MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 376.3MB. Max. memory is 16.1GB. * Witness Printer took 4.48ms. Allocated memory is still 2.1GB. Free memory is still 1.7GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.5s, 156 PlacesBefore, 53 PlacesAfterwards, 146 TransitionsBefore, 41 TransitionsAfterwards, 3934 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 137 TotalNumberOfCompositions, 10748 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4107, independent: 3870, independent conditional: 0, independent unconditional: 3870, dependent: 237, dependent conditional: 0, dependent unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1999, independent: 1958, independent conditional: 0, independent unconditional: 1958, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4107, independent: 1912, independent conditional: 0, independent unconditional: 1912, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 1999, unknown conditional: 0, unknown unconditional: 1999] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 135, Positive conditional cache size: 0, Positive unconditional cache size: 135, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L861] 0 pthread_t t1353; [L862] FCALL, FORK 0 pthread_create(&t1353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1353, ((void *)0), P0, ((void *)0))=-1, t1353={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1354; [L864] FCALL, FORK 0 pthread_create(&t1354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1354, ((void *)0), P1, ((void *)0))=0, t1353={11:0}, t1354={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L865] 0 pthread_t t1355; [L866] FCALL, FORK 0 pthread_create(&t1355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1355, ((void *)0), P2, ((void *)0))=1, t1353={11:0}, t1354={15:0}, t1355={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L867] 0 pthread_t t1356; [L868] FCALL, FORK 0 pthread_create(&t1356, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1356, ((void *)0), P3, ((void *)0))=2, t1353={11:0}, t1354={15:0}, t1355={7:0}, t1356={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L820] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L830] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L831] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 4 return 0; [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={11:0}, t1354={15:0}, t1355={7:0}, t1356={-2147483637:0}, weak$$choice2=0, x=2, y=1, z=1] [L881] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={6:8}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 866]: 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: 862]: 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: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 435 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 195 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 187 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1664 IncrementalHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 8 mSDtfsCounter, 1664 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=8, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 151 ConstructedInterpolants, 17 QuantifiedInterpolants, 2532 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1303 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:41:14,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5c20d7-a433-47a8-aba9-75491d03d250/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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