./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix006_power.oepc_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_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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_37c07a88-a4e8-4783-be95-1fe64586e2b1/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 932dbff5eab91f48afae7fbaa75574114ec0af0a04ac9352bdcfc8911a65e56a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:44:38,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:44:38,592 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:44:38,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:44:38,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:44:38,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:44:38,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:44:38,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:44:38,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:44:38,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:44:38,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:44:38,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:44:38,661 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:44:38,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:44:38,663 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:44:38,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:44:38,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:44:38,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:44:38,665 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:44:38,666 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:44:38,666 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:44:38,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:44:38,667 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:44:38,667 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:44:38,668 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:44:38,668 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:44:38,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:44:38,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:44:38,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:44:38,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:44:38,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:44:38,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:44:38,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:44:38,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:44:38,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:44:38,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:44:38,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:44:38,673 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:44:38,674 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_37c07a88-a4e8-4783-be95-1fe64586e2b1/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_37c07a88-a4e8-4783-be95-1fe64586e2b1/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 -> 932dbff5eab91f48afae7fbaa75574114ec0af0a04ac9352bdcfc8911a65e56a [2023-11-06 22:44:38,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:44:38,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:44:38,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:44:38,983 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:44:38,984 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:44:38,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:44:42,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:44:42,565 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:44:42,565 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:44:42,602 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/data/413007bf3/8cde7c48b9d34d7cbaa8dc588719ab2b/FLAGc1c7ca921 [2023-11-06 22:44:42,625 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/data/413007bf3/8cde7c48b9d34d7cbaa8dc588719ab2b [2023-11-06 22:44:42,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:44:42,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:44:42,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:44:42,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:44:42,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:44:42,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:44:42" (1/1) ... [2023-11-06 22:44:42,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d820b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:42, skipping insertion in model container [2023-11-06 22:44:42,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:44:42" (1/1) ... [2023-11-06 22:44:42,733 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:44:43,143 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:44:43,156 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:44:43,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:44:43,269 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:44:43,269 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:44:43,278 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:44:43,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:43 WrapperNode [2023-11-06 22:44:43,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:44:43,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:44:43,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:44:43,280 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:44:43,289 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:44:43" (1/1) ... [2023-11-06 22:44:43,329 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:44:43" (1/1) ... [2023-11-06 22:44:43,387 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2023-11-06 22:44:43,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:44:43,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:44:43,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:44:43,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:44:43,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:43" (1/1) ... [2023-11-06 22:44:43,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:43" (1/1) ... [2023-11-06 22:44:43,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:43" (1/1) ... [2023-11-06 22:44:43,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:43" (1/1) ... [2023-11-06 22:44:43,431 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:43" (1/1) ... [2023-11-06 22:44:43,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:43" (1/1) ... [2023-11-06 22:44:43,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:43" (1/1) ... [2023-11-06 22:44:43,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:43" (1/1) ... [2023-11-06 22:44:43,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:44:43,470 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:44:43,471 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:44:43,471 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:44:43,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:43" (1/1) ... [2023-11-06 22:44:43,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:44:43,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:44:43,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:44:43,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:44:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:44:43,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:44:43,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:44:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:44:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:44:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:44:43,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:44:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:44:43,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:44:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:44:43,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:44:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:44:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:44:43,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:44:43,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:44:43,580 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:44:43,792 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:44:43,794 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:44:44,295 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:44:44,487 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:44:44,488 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:44:44,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:44:44 BoogieIcfgContainer [2023-11-06 22:44:44,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:44:44,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:44:44,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:44:44,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:44:44,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:44:42" (1/3) ... [2023-11-06 22:44:44,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed77f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:44:44, skipping insertion in model container [2023-11-06 22:44:44,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:43" (2/3) ... [2023-11-06 22:44:44,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed77f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:44:44, skipping insertion in model container [2023-11-06 22:44:44,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:44:44" (3/3) ... [2023-11-06 22:44:44,504 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:44:44,523 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:44:44,523 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 22:44:44,523 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:44:44,600 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:44:44,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 130 transitions, 272 flow [2023-11-06 22:44:44,716 INFO L124 PetriNetUnfolderBase]: 3/127 cut-off events. [2023-11-06 22:44:44,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:44:44,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 3/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-06 22:44:44,721 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 130 transitions, 272 flow [2023-11-06 22:44:44,727 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 127 transitions, 263 flow [2023-11-06 22:44:44,731 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:44:44,740 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 127 transitions, 263 flow [2023-11-06 22:44:44,743 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 127 transitions, 263 flow [2023-11-06 22:44:44,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 127 transitions, 263 flow [2023-11-06 22:44:44,798 INFO L124 PetriNetUnfolderBase]: 3/127 cut-off events. [2023-11-06 22:44:44,798 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:44:44,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 3/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-06 22:44:44,804 INFO L119 LiptonReduction]: Number of co-enabled transitions 2784 [2023-11-06 22:44:50,664 INFO L134 LiptonReduction]: Checked pairs total: 7471 [2023-11-06 22:44:50,667 INFO L136 LiptonReduction]: Total number of compositions: 128 [2023-11-06 22:44:50,699 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:44:50,711 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;@4a22cbb7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:44:50,712 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 22:44:50,715 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:44:50,715 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:44:50,715 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:44:50,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:44:50,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:44:50,718 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:44:50,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:50,725 INFO L85 PathProgramCache]: Analyzing trace with hash 581, now seen corresponding path program 1 times [2023-11-06 22:44:50,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:50,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186219551] [2023-11-06 22:44:50,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:50,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:50,882 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:44:50,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:50,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186219551] [2023-11-06 22:44:50,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186219551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:50,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:50,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:44:50,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245823589] [2023-11-06 22:44:50,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:50,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:44:50,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:50,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:44:50,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:44:50,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 258 [2023-11-06 22:44:50,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 77 flow. Second operand has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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:44:50,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:44:50,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 258 [2023-11-06 22:44:50,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:44:51,504 INFO L124 PetriNetUnfolderBase]: 1616/2391 cut-off events. [2023-11-06 22:44:51,505 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-06 22:44:51,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4815 conditions, 2391 events. 1616/2391 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11840 event pairs, 1616 based on Foata normal form. 0/2015 useless extension candidates. Maximal degree in co-relation 4804. Up to 2368 conditions per place. [2023-11-06 22:44:51,538 INFO L140 encePairwiseOnDemand]: 251/258 looper letters, 23 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-11-06 22:44:51,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 109 flow [2023-11-06 22:44:51,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:44:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:44:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 262 transitions. [2023-11-06 22:44:51,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5077519379844961 [2023-11-06 22:44:51,564 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 262 transitions. [2023-11-06 22:44:51,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 262 transitions. [2023-11-06 22:44:51,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:44:51,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 262 transitions. [2023-11-06 22:44:51,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 131.0) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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:44:51,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 0 states 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:44:51,583 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 0 states 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:44:51,585 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 77 flow. Second operand 2 states and 262 transitions. [2023-11-06 22:44:51,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 109 flow [2023-11-06 22:44:51,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:44:51,592 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2023-11-06 22:44:51,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-11-06 22:44:51,600 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -8 predicate places. [2023-11-06 22:44:51,601 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2023-11-06 22:44:51,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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:44:51,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:44:51,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:44:51,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:44:51,603 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:44:51,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:51,604 INFO L85 PathProgramCache]: Analyzing trace with hash 570804, now seen corresponding path program 1 times [2023-11-06 22:44:51,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:51,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009739222] [2023-11-06 22:44:51,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:51,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:51,954 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:44:51,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:51,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009739222] [2023-11-06 22:44:51,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009739222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:51,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:51,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:44:51,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816665820] [2023-11-06 22:44:51,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:51,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:44:51,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:51,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:44:51,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:44:51,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 258 [2023-11-06 22:44:51,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:44:51,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:44:51,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 258 [2023-11-06 22:44:51,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:44:52,372 INFO L124 PetriNetUnfolderBase]: 1263/1903 cut-off events. [2023-11-06 22:44:52,372 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:44:52,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3812 conditions, 1903 events. 1263/1903 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9252 event pairs, 562 based on Foata normal form. 0/1737 useless extension candidates. Maximal degree in co-relation 3809. Up to 1510 conditions per place. [2023-11-06 22:44:52,390 INFO L140 encePairwiseOnDemand]: 255/258 looper letters, 35 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2023-11-06 22:44:52,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 174 flow [2023-11-06 22:44:52,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:44:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:44:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-11-06 22:44:52,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974160206718346 [2023-11-06 22:44:52,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-11-06 22:44:52,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-11-06 22:44:52,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:44:52,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-11-06 22:44:52,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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:44:52,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states 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:44:52,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states 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:44:52,406 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 3 states and 385 transitions. [2023-11-06 22:44:52,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 174 flow [2023-11-06 22:44:52,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:44:52,413 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 60 flow [2023-11-06 22:44:52,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-11-06 22:44:52,415 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2023-11-06 22:44:52,415 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 60 flow [2023-11-06 22:44:52,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:44:52,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:44:52,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:52,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:44:52,425 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:44:52,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:52,426 INFO L85 PathProgramCache]: Analyzing trace with hash -73918729, now seen corresponding path program 1 times [2023-11-06 22:44:52,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:52,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954713060] [2023-11-06 22:44:52,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:52,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:52,842 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:44:52,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:52,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954713060] [2023-11-06 22:44:52,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954713060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:52,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:52,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:44:52,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113242320] [2023-11-06 22:44:52,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:52,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:44:52,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:52,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:44:52,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:44:52,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 258 [2023-11-06 22:44:52,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:44:52,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:44:52,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 258 [2023-11-06 22:44:52,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:44:53,423 INFO L124 PetriNetUnfolderBase]: 1410/2196 cut-off events. [2023-11-06 22:44:53,423 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2023-11-06 22:44:53,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4497 conditions, 2196 events. 1410/2196 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11334 event pairs, 395 based on Foata normal form. 0/2127 useless extension candidates. Maximal degree in co-relation 4493. Up to 1305 conditions per place. [2023-11-06 22:44:53,443 INFO L140 encePairwiseOnDemand]: 253/258 looper letters, 48 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2023-11-06 22:44:53,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 57 transitions, 240 flow [2023-11-06 22:44:53,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:44:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:44:53,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2023-11-06 22:44:53,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465891472868217 [2023-11-06 22:44:53,447 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 601 transitions. [2023-11-06 22:44:53,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 601 transitions. [2023-11-06 22:44:53,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:44:53,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 601 transitions. [2023-11-06 22:44:53,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 0 states have call successors, (0), 0 states 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:44:53,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states 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:44:53,455 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states 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:44:53,455 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 60 flow. Second operand 5 states and 601 transitions. [2023-11-06 22:44:53,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 57 transitions, 240 flow [2023-11-06 22:44:53,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 57 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:44:53,458 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 93 flow [2023-11-06 22:44:53,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-11-06 22:44:53,459 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-11-06 22:44:53,460 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 93 flow [2023-11-06 22:44:53,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:44:53,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:44:53,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:53,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:44:53,461 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:44:53,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:53,462 INFO L85 PathProgramCache]: Analyzing trace with hash -73918700, now seen corresponding path program 1 times [2023-11-06 22:44:53,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:53,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604229432] [2023-11-06 22:44:53,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:53,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:54,093 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:44:54,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:54,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604229432] [2023-11-06 22:44:54,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604229432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:54,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:54,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:44:54,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992295604] [2023-11-06 22:44:54,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:54,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:44:54,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:54,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:44:54,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:44:54,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 258 [2023-11-06 22:44:54,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:44:54,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:44:54,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 258 [2023-11-06 22:44:54,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:44:54,836 INFO L124 PetriNetUnfolderBase]: 1131/1723 cut-off events. [2023-11-06 22:44:54,836 INFO L125 PetriNetUnfolderBase]: For 560/572 co-relation queries the response was YES. [2023-11-06 22:44:54,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3807 conditions, 1723 events. 1131/1723 cut-off events. For 560/572 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8430 event pairs, 160 based on Foata normal form. 204/1922 useless extension candidates. Maximal degree in co-relation 3800. Up to 1128 conditions per place. [2023-11-06 22:44:54,849 INFO L140 encePairwiseOnDemand]: 253/258 looper letters, 36 selfloop transitions, 4 changer transitions 3/46 dead transitions. [2023-11-06 22:44:54,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 212 flow [2023-11-06 22:44:54,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:44:54,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:44:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2023-11-06 22:44:54,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41472868217054265 [2023-11-06 22:44:54,853 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 642 transitions. [2023-11-06 22:44:54,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions. [2023-11-06 22:44:54,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:44:54,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions. [2023-11-06 22:44:54,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.0) internal successors, (642), 6 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:44:54,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states 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:44:54,862 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states 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:44:54,862 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 93 flow. Second operand 6 states and 642 transitions. [2023-11-06 22:44:54,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 212 flow [2023-11-06 22:44:54,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:44:54,867 INFO L231 Difference]: Finished difference. Result has 43 places, 24 transitions, 72 flow [2023-11-06 22:44:54,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=24} [2023-11-06 22:44:54,870 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-11-06 22:44:54,870 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 24 transitions, 72 flow [2023-11-06 22:44:54,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:44:54,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:44:54,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:54,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:44:54,872 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:44:54,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash 707872102, now seen corresponding path program 1 times [2023-11-06 22:44:54,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:54,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456924042] [2023-11-06 22:44:54,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:54,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:55,114 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:44:55,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:55,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456924042] [2023-11-06 22:44:55,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456924042] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:55,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:55,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:44:55,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328843077] [2023-11-06 22:44:55,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:55,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:44:55,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:55,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:44:55,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:44:55,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 258 [2023-11-06 22:44:55,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 24 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states 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:44:55,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:44:55,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 258 [2023-11-06 22:44:55,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:44:56,046 INFO L124 PetriNetUnfolderBase]: 2511/3762 cut-off events. [2023-11-06 22:44:56,047 INFO L125 PetriNetUnfolderBase]: For 943/943 co-relation queries the response was YES. [2023-11-06 22:44:56,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8310 conditions, 3762 events. 2511/3762 cut-off events. For 943/943 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17664 event pairs, 551 based on Foata normal form. 168/3930 useless extension candidates. Maximal degree in co-relation 8303. Up to 1823 conditions per place. [2023-11-06 22:44:56,077 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 41 selfloop transitions, 7 changer transitions 29/77 dead transitions. [2023-11-06 22:44:56,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 77 transitions, 346 flow [2023-11-06 22:44:56,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:44:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:44:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 787 transitions. [2023-11-06 22:44:56,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43576965669988926 [2023-11-06 22:44:56,082 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 787 transitions. [2023-11-06 22:44:56,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 787 transitions. [2023-11-06 22:44:56,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:44:56,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 787 transitions. [2023-11-06 22:44:56,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.42857142857143) internal successors, (787), 7 states have internal predecessors, (787), 0 states have call successors, (0), 0 states 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:44:56,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states 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:44:56,091 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states 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:44:56,091 INFO L175 Difference]: Start difference. First operand has 43 places, 24 transitions, 72 flow. Second operand 7 states and 787 transitions. [2023-11-06 22:44:56,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 77 transitions, 346 flow [2023-11-06 22:44:56,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 77 transitions, 326 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-11-06 22:44:56,123 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 124 flow [2023-11-06 22:44:56,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=124, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2023-11-06 22:44:56,126 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2023-11-06 22:44:56,126 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 124 flow [2023-11-06 22:44:56,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states 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:44:56,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:44:56,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:56,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:44:56,127 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:44:56,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:56,128 INFO L85 PathProgramCache]: Analyzing trace with hash 185608635, now seen corresponding path program 1 times [2023-11-06 22:44:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:56,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971579138] [2023-11-06 22:44:56,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:56,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:56,328 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:44:56,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:56,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971579138] [2023-11-06 22:44:56,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971579138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:56,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:56,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:44:56,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899722615] [2023-11-06 22:44:56,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:56,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:44:56,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:56,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:44:56,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:44:56,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 258 [2023-11-06 22:44:56,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:44:56,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:44:56,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 258 [2023-11-06 22:44:56,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:44:56,895 INFO L124 PetriNetUnfolderBase]: 1064/1775 cut-off events. [2023-11-06 22:44:56,895 INFO L125 PetriNetUnfolderBase]: For 1229/1286 co-relation queries the response was YES. [2023-11-06 22:44:56,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4590 conditions, 1775 events. 1064/1775 cut-off events. For 1229/1286 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9745 event pairs, 216 based on Foata normal form. 174/1871 useless extension candidates. Maximal degree in co-relation 4580. Up to 1030 conditions per place. [2023-11-06 22:44:56,915 INFO L140 encePairwiseOnDemand]: 252/258 looper letters, 46 selfloop transitions, 7 changer transitions 10/70 dead transitions. [2023-11-06 22:44:56,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 378 flow [2023-11-06 22:44:56,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:44:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:44:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2023-11-06 22:44:56,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47054263565891474 [2023-11-06 22:44:56,920 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 607 transitions. [2023-11-06 22:44:56,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 607 transitions. [2023-11-06 22:44:56,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:44:56,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 607 transitions. [2023-11-06 22:44:56,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states 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:44:56,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states 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:44:56,928 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states 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:44:56,929 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 124 flow. Second operand 5 states and 607 transitions. [2023-11-06 22:44:56,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 378 flow [2023-11-06 22:44:56,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 372 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-06 22:44:56,935 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 172 flow [2023-11-06 22:44:56,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=5, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-11-06 22:44:56,937 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2023-11-06 22:44:56,937 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 172 flow [2023-11-06 22:44:56,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:44:56,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:44:56,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:56,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:44:56,939 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:44:56,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:56,939 INFO L85 PathProgramCache]: Analyzing trace with hash -697935406, now seen corresponding path program 1 times [2023-11-06 22:44:56,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:56,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399037952] [2023-11-06 22:44:56,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:56,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:57,196 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:44:57,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:57,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399037952] [2023-11-06 22:44:57,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399037952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:57,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:57,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:44:57,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410723884] [2023-11-06 22:44:57,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:57,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:44:57,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:57,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:44:57,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:44:57,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 258 [2023-11-06 22:44:57,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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:44:57,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:44:57,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 258 [2023-11-06 22:44:57,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:44:57,763 INFO L124 PetriNetUnfolderBase]: 726/1279 cut-off events. [2023-11-06 22:44:57,764 INFO L125 PetriNetUnfolderBase]: For 1173/1210 co-relation queries the response was YES. [2023-11-06 22:44:57,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4000 conditions, 1279 events. 726/1279 cut-off events. For 1173/1210 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7130 event pairs, 103 based on Foata normal form. 92/1310 useless extension candidates. Maximal degree in co-relation 3987. Up to 381 conditions per place. [2023-11-06 22:44:57,779 INFO L140 encePairwiseOnDemand]: 252/258 looper letters, 55 selfloop transitions, 13 changer transitions 21/96 dead transitions. [2023-11-06 22:44:57,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 96 transitions, 586 flow [2023-11-06 22:44:57,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:44:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:44:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 849 transitions. [2023-11-06 22:44:57,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4700996677740864 [2023-11-06 22:44:57,784 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 849 transitions. [2023-11-06 22:44:57,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 849 transitions. [2023-11-06 22:44:57,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:44:57,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 849 transitions. [2023-11-06 22:44:57,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states 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:44:57,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states 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:44:57,795 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states 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:44:57,795 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 172 flow. Second operand 7 states and 849 transitions. [2023-11-06 22:44:57,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 96 transitions, 586 flow [2023-11-06 22:44:57,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 96 transitions, 580 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:44:57,805 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 254 flow [2023-11-06 22:44:57,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-11-06 22:44:57,806 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2023-11-06 22:44:57,806 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 254 flow [2023-11-06 22:44:57,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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:44:57,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:44:57,807 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:44:57,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:44:57,808 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:44:57,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:57,809 INFO L85 PathProgramCache]: Analyzing trace with hash -87547472, now seen corresponding path program 1 times [2023-11-06 22:44:57,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:57,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022492224] [2023-11-06 22:44:57,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:57,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:58,182 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:44:58,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:58,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022492224] [2023-11-06 22:44:58,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022492224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:58,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:58,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:44:58,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583587940] [2023-11-06 22:44:58,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:58,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:44:58,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:58,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:44:58,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:44:58,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 258 [2023-11-06 22:44:58,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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:44:58,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:44:58,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 258 [2023-11-06 22:44:58,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:44:59,075 INFO L124 PetriNetUnfolderBase]: 1515/2545 cut-off events. [2023-11-06 22:44:59,075 INFO L125 PetriNetUnfolderBase]: For 5279/5279 co-relation queries the response was YES. [2023-11-06 22:44:59,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9393 conditions, 2545 events. 1515/2545 cut-off events. For 5279/5279 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13663 event pairs, 73 based on Foata normal form. 16/2561 useless extension candidates. Maximal degree in co-relation 9378. Up to 1122 conditions per place. [2023-11-06 22:44:59,101 INFO L140 encePairwiseOnDemand]: 248/258 looper letters, 68 selfloop transitions, 17 changer transitions 33/118 dead transitions. [2023-11-06 22:44:59,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 118 transitions, 967 flow [2023-11-06 22:44:59,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:44:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:44:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 771 transitions. [2023-11-06 22:44:59,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4269102990033223 [2023-11-06 22:44:59,107 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 771 transitions. [2023-11-06 22:44:59,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 771 transitions. [2023-11-06 22:44:59,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:44:59,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 771 transitions. [2023-11-06 22:44:59,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:44:59,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states 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:44:59,118 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states 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:44:59,119 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 254 flow. Second operand 7 states and 771 transitions. [2023-11-06 22:44:59,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 118 transitions, 967 flow [2023-11-06 22:44:59,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 870 flow, removed 36 selfloop flow, removed 2 redundant places. [2023-11-06 22:44:59,169 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 338 flow [2023-11-06 22:44:59,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=338, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2023-11-06 22:44:59,170 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2023-11-06 22:44:59,171 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 338 flow [2023-11-06 22:44:59,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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:44:59,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:44:59,172 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:44:59,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:44:59,173 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:44:59,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:59,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1058916638, now seen corresponding path program 2 times [2023-11-06 22:44:59,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:59,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318488919] [2023-11-06 22:44:59,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:59,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,581 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:44:59,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:59,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318488919] [2023-11-06 22:44:59,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318488919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:59,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:59,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:44:59,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262914689] [2023-11-06 22:44:59,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:59,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:44:59,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:59,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:44:59,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:44:59,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 258 [2023-11-06 22:44:59,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 338 flow. Second operand has 6 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 0 states 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:44:59,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:44:59,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 258 [2023-11-06 22:44:59,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:45:00,008 INFO L124 PetriNetUnfolderBase]: 447/864 cut-off events. [2023-11-06 22:45:00,008 INFO L125 PetriNetUnfolderBase]: For 1635/1668 co-relation queries the response was YES. [2023-11-06 22:45:00,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3172 conditions, 864 events. 447/864 cut-off events. For 1635/1668 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4560 event pairs, 119 based on Foata normal form. 38/876 useless extension candidates. Maximal degree in co-relation 3151. Up to 305 conditions per place. [2023-11-06 22:45:00,021 INFO L140 encePairwiseOnDemand]: 252/258 looper letters, 50 selfloop transitions, 11 changer transitions 16/92 dead transitions. [2023-11-06 22:45:00,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 92 transitions, 756 flow [2023-11-06 22:45:00,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:45:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:45:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 829 transitions. [2023-11-06 22:45:00,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4590254706533776 [2023-11-06 22:45:00,032 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 829 transitions. [2023-11-06 22:45:00,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 829 transitions. [2023-11-06 22:45:00,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:45:00,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 829 transitions. [2023-11-06 22:45:00,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states 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:45:00,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states 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:45:00,044 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states 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:45:00,045 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 338 flow. Second operand 7 states and 829 transitions. [2023-11-06 22:45:00,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 92 transitions, 756 flow [2023-11-06 22:45:00,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 92 transitions, 698 flow, removed 25 selfloop flow, removed 7 redundant places. [2023-11-06 22:45:00,057 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 338 flow [2023-11-06 22:45:00,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=338, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2023-11-06 22:45:00,059 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2023-11-06 22:45:00,059 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 338 flow [2023-11-06 22:45:00,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 0 states 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:45:00,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:45:00,061 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:45:00,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:45:00,062 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:45:00,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:00,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1943208587, now seen corresponding path program 1 times [2023-11-06 22:45:00,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:00,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311918636] [2023-11-06 22:45:00,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:00,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:01,353 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:45:01,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:01,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311918636] [2023-11-06 22:45:01,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311918636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:01,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:01,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:45:01,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655594986] [2023-11-06 22:45:01,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:01,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:45:01,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:01,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:45:01,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:45:01,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 258 [2023-11-06 22:45:01,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 338 flow. Second operand has 8 states, 8 states have (on average 108.5) internal successors, (868), 8 states have internal predecessors, (868), 0 states have call successors, (0), 0 states 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:45:01,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:45:01,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 258 [2023-11-06 22:45:01,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:45:02,003 INFO L124 PetriNetUnfolderBase]: 661/1332 cut-off events. [2023-11-06 22:45:02,003 INFO L125 PetriNetUnfolderBase]: For 2873/2915 co-relation queries the response was YES. [2023-11-06 22:45:02,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5229 conditions, 1332 events. 661/1332 cut-off events. For 2873/2915 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8211 event pairs, 151 based on Foata normal form. 19/1320 useless extension candidates. Maximal degree in co-relation 5211. Up to 441 conditions per place. [2023-11-06 22:45:02,018 INFO L140 encePairwiseOnDemand]: 250/258 looper letters, 71 selfloop transitions, 5 changer transitions 30/121 dead transitions. [2023-11-06 22:45:02,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 121 transitions, 1030 flow [2023-11-06 22:45:02,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:45:02,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:45:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 912 transitions. [2023-11-06 22:45:02,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2023-11-06 22:45:02,023 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 912 transitions. [2023-11-06 22:45:02,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 912 transitions. [2023-11-06 22:45:02,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:45:02,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 912 transitions. [2023-11-06 22:45:02,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states 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:45:02,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states 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:45:02,034 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states 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:45:02,034 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 338 flow. Second operand 8 states and 912 transitions. [2023-11-06 22:45:02,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 121 transitions, 1030 flow [2023-11-06 22:45:02,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 121 transitions, 890 flow, removed 42 selfloop flow, removed 7 redundant places. [2023-11-06 22:45:02,058 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 337 flow [2023-11-06 22:45:02,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=337, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2023-11-06 22:45:02,059 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-11-06 22:45:02,059 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 337 flow [2023-11-06 22:45:02,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.5) internal successors, (868), 8 states have internal predecessors, (868), 0 states have call successors, (0), 0 states 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:45:02,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:45:02,060 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:45:02,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:45:02,061 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:45:02,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:02,062 INFO L85 PathProgramCache]: Analyzing trace with hash -40598543, now seen corresponding path program 2 times [2023-11-06 22:45:02,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:02,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829764038] [2023-11-06 22:45:02,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:02,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:02,476 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:45:02,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:02,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829764038] [2023-11-06 22:45:02,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829764038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:02,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:02,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:45:02,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826923666] [2023-11-06 22:45:02,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:02,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:45:02,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:02,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:45:02,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:45:02,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 258 [2023-11-06 22:45:02,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 337 flow. Second operand has 6 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 states 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:45:02,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:45:02,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 258 [2023-11-06 22:45:02,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:45:03,138 INFO L124 PetriNetUnfolderBase]: 836/1537 cut-off events. [2023-11-06 22:45:03,139 INFO L125 PetriNetUnfolderBase]: For 3176/3176 co-relation queries the response was YES. [2023-11-06 22:45:03,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6243 conditions, 1537 events. 836/1537 cut-off events. For 3176/3176 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8332 event pairs, 189 based on Foata normal form. 1/1538 useless extension candidates. Maximal degree in co-relation 6223. Up to 509 conditions per place. [2023-11-06 22:45:03,155 INFO L140 encePairwiseOnDemand]: 248/258 looper letters, 51 selfloop transitions, 11 changer transitions 53/115 dead transitions. [2023-11-06 22:45:03,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 115 transitions, 942 flow [2023-11-06 22:45:03,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:45:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:45:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 766 transitions. [2023-11-06 22:45:03,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42414174972314506 [2023-11-06 22:45:03,161 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 766 transitions. [2023-11-06 22:45:03,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 766 transitions. [2023-11-06 22:45:03,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:45:03,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 766 transitions. [2023-11-06 22:45:03,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.42857142857143) internal successors, (766), 7 states have internal predecessors, (766), 0 states have call successors, (0), 0 states 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:45:03,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states 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:45:03,171 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states 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:45:03,171 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 337 flow. Second operand 7 states and 766 transitions. [2023-11-06 22:45:03,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 115 transitions, 942 flow [2023-11-06 22:45:03,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 115 transitions, 911 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-11-06 22:45:03,194 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 281 flow [2023-11-06 22:45:03,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=281, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2023-11-06 22:45:03,195 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-11-06 22:45:03,195 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 281 flow [2023-11-06 22:45:03,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 states 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:45:03,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:45:03,196 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:45:03,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:45:03,197 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:45:03,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:03,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1548843801, now seen corresponding path program 3 times [2023-11-06 22:45:03,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:03,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204340999] [2023-11-06 22:45:03,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:03,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:03,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:03,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:03,404 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:45:03,405 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 22:45:03,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 22:45:03,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 22:45:03,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 22:45:03,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 22:45:03,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 22:45:03,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 22:45:03,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 22:45:03,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 22:45:03,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 22:45:03,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 22:45:03,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 22:45:03,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 22:45:03,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:45:03,412 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:03,419 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:45:03,419 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:45:03,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:45:03 BasicIcfg [2023-11-06 22:45:03,547 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:45:03,548 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:45:03,548 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:45:03,548 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:45:03,549 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:44:44" (3/4) ... [2023-11-06 22:45:03,551 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:45:03,562 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:45:03,563 INFO L158 Benchmark]: Toolchain (without parser) took 20926.05ms. Allocated memory was 161.5MB in the beginning and 343.9MB in the end (delta: 182.5MB). Free memory was 131.3MB in the beginning and 310.2MB in the end (delta: -178.9MB). Peak memory consumption was 208.4MB. Max. memory is 16.1GB. [2023-11-06 22:45:03,563 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 107.0MB. Free memory is still 54.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:45:03,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 638.18ms. Allocated memory is still 161.5MB. Free memory was 130.9MB in the beginning and 107.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:45:03,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.65ms. Allocated memory is still 161.5MB. Free memory was 107.4MB in the beginning and 104.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:45:03,564 INFO L158 Benchmark]: Boogie Preprocessor took 80.57ms. Allocated memory is still 161.5MB. Free memory was 104.9MB in the beginning and 103.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:45:03,565 INFO L158 Benchmark]: RCFGBuilder took 1020.51ms. Allocated memory is still 161.5MB. Free memory was 103.2MB in the beginning and 113.3MB in the end (delta: -10.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:45:03,565 INFO L158 Benchmark]: TraceAbstraction took 19052.07ms. Allocated memory was 161.5MB in the beginning and 343.9MB in the end (delta: 182.5MB). Free memory was 112.5MB in the beginning and 109.6MB in the end (delta: 3.0MB). Peak memory consumption was 186.2MB. Max. memory is 16.1GB. [2023-11-06 22:45:03,566 INFO L158 Benchmark]: Witness Printer took 14.25ms. Allocated memory is still 343.9MB. Free memory was 109.6MB in the beginning and 310.2MB in the end (delta: -200.7MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2023-11-06 22:45:03,568 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.30ms. Allocated memory is still 107.0MB. Free memory is still 54.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 638.18ms. Allocated memory is still 161.5MB. Free memory was 130.9MB in the beginning and 107.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.65ms. Allocated memory is still 161.5MB. Free memory was 107.4MB in the beginning and 104.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.57ms. Allocated memory is still 161.5MB. Free memory was 104.9MB in the beginning and 103.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1020.51ms. Allocated memory is still 161.5MB. Free memory was 103.2MB in the beginning and 113.3MB in the end (delta: -10.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19052.07ms. Allocated memory was 161.5MB in the beginning and 343.9MB in the end (delta: 182.5MB). Free memory was 112.5MB in the beginning and 109.6MB in the end (delta: 3.0MB). Peak memory consumption was 186.2MB. Max. memory is 16.1GB. * Witness Printer took 14.25ms. Allocated memory is still 343.9MB. Free memory was 109.6MB in the beginning and 310.2MB in the end (delta: -200.7MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 134 PlacesBefore, 43 PlacesAfterwards, 127 TransitionsBefore, 34 TransitionsAfterwards, 2784 CoEnabledTransitionPairs, 6 FixpointIterations, 50 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 128 TotalNumberOfCompositions, 7471 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3336, independent: 3148, independent conditional: 0, independent unconditional: 3148, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1448, independent: 1413, independent conditional: 0, independent unconditional: 1413, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3336, independent: 1735, independent conditional: 0, independent unconditional: 1735, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 1448, unknown conditional: 0, unknown unconditional: 1448] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t153; [L844] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t153, ((void *)0), P0, ((void *)0))=-3, t153={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L845] 0 pthread_t t154; [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t154, ((void *)0), P1, ((void *)0))=-2, t153={5:0}, t154={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 0 pthread_t t155; [L848] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t155, ((void *)0), P2, ((void *)0))=-1, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L786] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L787] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L789] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L799] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 z$flush_delayed = weak$$choice2 [L808] 3 z$mem_tmp = z [L809] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L810] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L811] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L812] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L813] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L815] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = z [L817] 3 z = z$flush_delayed ? z$mem_tmp : z [L818] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] 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", "mix006_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that 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: 844]: 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: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 158 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 668 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 541 mSDsluCounter, 336 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 251 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1590 IncrementalHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 85 mSDtfsCounter, 1590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=8, InterpolantAutomatonStates: 64, 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.0s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 1106 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:45:03,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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_37c07a88-a4e8-4783-be95-1fe64586e2b1/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 932dbff5eab91f48afae7fbaa75574114ec0af0a04ac9352bdcfc8911a65e56a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:45:06,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:45:06,658 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:45:06,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:45:06,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:45:06,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:45:06,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:45:06,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:45:06,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:45:06,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:45:06,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:45:06,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:45:06,735 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:45:06,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:45:06,738 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:45:06,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:45:06,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:45:06,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:45:06,740 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:45:06,741 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:45:06,742 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:45:06,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:45:06,743 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:45:06,744 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:45:06,744 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:45:06,745 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:45:06,746 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:45:06,746 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:45:06,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:45:06,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:45:06,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:45:06,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:45:06,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:45:06,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:45:06,751 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:45:06,751 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:45:06,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:45:06,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:45:06,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:45:06,754 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:45:06,754 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:45:06,754 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_37c07a88-a4e8-4783-be95-1fe64586e2b1/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_37c07a88-a4e8-4783-be95-1fe64586e2b1/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 -> 932dbff5eab91f48afae7fbaa75574114ec0af0a04ac9352bdcfc8911a65e56a [2023-11-06 22:45:07,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:45:07,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:45:07,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:45:07,319 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:45:07,320 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:45:07,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:45:10,779 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:45:11,247 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:45:11,248 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/sv-benchmarks/c/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:45:11,274 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/data/b5b6c682d/cae14f033fa0410d9f788fcaf6a9a0b2/FLAG13c6bc711 [2023-11-06 22:45:11,295 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/data/b5b6c682d/cae14f033fa0410d9f788fcaf6a9a0b2 [2023-11-06 22:45:11,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:45:11,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:45:11,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:45:11,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:45:11,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:45:11,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:11" (1/1) ... [2023-11-06 22:45:11,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3e1c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:11, skipping insertion in model container [2023-11-06 22:45:11,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:11" (1/1) ... [2023-11-06 22:45:11,406 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:45:12,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:45:12,092 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:45:12,233 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:45:12,306 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:45:12,306 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:45:12,316 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:45:12,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:12 WrapperNode [2023-11-06 22:45:12,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:45:12,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:45:12,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:45:12,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:45:12,333 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:45:12" (1/1) ... [2023-11-06 22:45:12,387 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:45:12" (1/1) ... [2023-11-06 22:45:12,443 INFO L138 Inliner]: procedures = 179, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2023-11-06 22:45:12,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:45:12,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:45:12,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:45:12,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:45:12,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:12" (1/1) ... [2023-11-06 22:45:12,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:12" (1/1) ... [2023-11-06 22:45:12,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:12" (1/1) ... [2023-11-06 22:45:12,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:12" (1/1) ... [2023-11-06 22:45:12,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:12" (1/1) ... [2023-11-06 22:45:12,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:12" (1/1) ... [2023-11-06 22:45:12,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:12" (1/1) ... [2023-11-06 22:45:12,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:12" (1/1) ... [2023-11-06 22:45:12,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:45:12,545 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:45:12,545 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:45:12,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:45:12,547 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:12" (1/1) ... [2023-11-06 22:45:12,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:45:12,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:12,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:12,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:12,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:45:12,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:45:12,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:45:12,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:45:12,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:45:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:45:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:45:12,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:45:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:45:12,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:45:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:45:12,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:45:12,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:45:12,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:45:12,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:45:12,679 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:45:12,957 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:45:12,960 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:45:13,507 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:45:13,801 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:45:13,801 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:45:13,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:13 BoogieIcfgContainer [2023-11-06 22:45:13,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:45:13,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:45:13,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:45:13,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:45:13,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:45:11" (1/3) ... [2023-11-06 22:45:13,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3deff345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:45:13, skipping insertion in model container [2023-11-06 22:45:13,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:12" (2/3) ... [2023-11-06 22:45:13,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3deff345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:45:13, skipping insertion in model container [2023-11-06 22:45:13,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:13" (3/3) ... [2023-11-06 22:45:13,824 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:45:13,851 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:45:13,852 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 22:45:13,852 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:45:13,959 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:45:14,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 131 transitions, 274 flow [2023-11-06 22:45:14,146 INFO L124 PetriNetUnfolderBase]: 3/128 cut-off events. [2023-11-06 22:45:14,147 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:45:14,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 3/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-06 22:45:14,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 131 transitions, 274 flow [2023-11-06 22:45:14,168 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 128 transitions, 265 flow [2023-11-06 22:45:14,174 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:45:14,194 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 128 transitions, 265 flow [2023-11-06 22:45:14,198 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 128 transitions, 265 flow [2023-11-06 22:45:14,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 128 transitions, 265 flow [2023-11-06 22:45:14,240 INFO L124 PetriNetUnfolderBase]: 3/128 cut-off events. [2023-11-06 22:45:14,241 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:45:14,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 3/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-06 22:45:14,246 INFO L119 LiptonReduction]: Number of co-enabled transitions 2784 [2023-11-06 22:45:25,901 INFO L134 LiptonReduction]: Checked pairs total: 8206 [2023-11-06 22:45:25,902 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-11-06 22:45:25,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:45:25,931 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;@7be65578, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:45:25,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 22:45:25,933 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:45:25,933 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:45:25,934 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:45:25,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:45:25,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:45:25,935 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:45:25,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:25,942 INFO L85 PathProgramCache]: Analyzing trace with hash 582, now seen corresponding path program 1 times [2023-11-06 22:45:25,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:45:25,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881226235] [2023-11-06 22:45:25,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:25,957 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:45:25,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:45:25,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:26,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:26,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:45:26,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:26,115 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:45:26,115 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:45:26,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:45:26,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881226235] [2023-11-06 22:45:26,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881226235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:26,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:26,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:45:26,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902782358] [2023-11-06 22:45:26,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:26,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:45:26,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:45:26,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:45:26,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:45:26,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 262 [2023-11-06 22:45:26,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states 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:45:26,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:45:26,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 262 [2023-11-06 22:45:26,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:45:27,002 INFO L124 PetriNetUnfolderBase]: 1381/2057 cut-off events. [2023-11-06 22:45:27,002 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-06 22:45:27,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4146 conditions, 2057 events. 1381/2057 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10052 event pairs, 1381 based on Foata normal form. 0/1701 useless extension candidates. Maximal degree in co-relation 4135. Up to 2033 conditions per place. [2023-11-06 22:45:27,031 INFO L140 encePairwiseOnDemand]: 255/262 looper letters, 22 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-11-06 22:45:27,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 105 flow [2023-11-06 22:45:27,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:45:27,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:45:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 263 transitions. [2023-11-06 22:45:27,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5019083969465649 [2023-11-06 22:45:27,058 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 263 transitions. [2023-11-06 22:45:27,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 263 transitions. [2023-11-06 22:45:27,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:45:27,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 263 transitions. [2023-11-06 22:45:27,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:45:27,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:45:27,073 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:45:27,075 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 263 transitions. [2023-11-06 22:45:27,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 105 flow [2023-11-06 22:45:27,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:45:27,082 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-11-06 22:45:27,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-11-06 22:45:27,088 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-11-06 22:45:27,088 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-11-06 22:45:27,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states 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:45:27,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:45:27,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:45:27,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:27,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:27,302 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:45:27,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:27,302 INFO L85 PathProgramCache]: Analyzing trace with hash 573751, now seen corresponding path program 1 times [2023-11-06 22:45:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:45:27,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323359744] [2023-11-06 22:45:27,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:27,304 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:45:27,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:45:27,306 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:27,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:27,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:45:27,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:27,428 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:45:27,429 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:45:27,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:45:27,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323359744] [2023-11-06 22:45:27,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323359744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:27,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:27,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:45:27,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375517292] [2023-11-06 22:45:27,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:27,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:45:27,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:45:27,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:45:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:45:27,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 262 [2023-11-06 22:45:27,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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:45:27,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:45:27,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 262 [2023-11-06 22:45:27,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:45:27,924 INFO L124 PetriNetUnfolderBase]: 1079/1735 cut-off events. [2023-11-06 22:45:27,924 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:45:27,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3380 conditions, 1735 events. 1079/1735 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9794 event pairs, 173 based on Foata normal form. 0/1569 useless extension candidates. Maximal degree in co-relation 3377. Up to 1297 conditions per place. [2023-11-06 22:45:27,942 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-11-06 22:45:27,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 166 flow [2023-11-06 22:45:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:45:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:45:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-11-06 22:45:27,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4910941475826972 [2023-11-06 22:45:27,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-11-06 22:45:27,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-11-06 22:45:27,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:45:27,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-11-06 22:45:27,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states 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:45:27,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states 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:45:27,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states 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:45:27,967 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 386 transitions. [2023-11-06 22:45:27,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 166 flow [2023-11-06 22:45:27,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:45:27,970 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2023-11-06 22:45:27,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-11-06 22:45:27,971 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-11-06 22:45:27,972 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2023-11-06 22:45:27,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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:45:27,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:45:27,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:27,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:28,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:28,185 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:45:28,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:28,185 INFO L85 PathProgramCache]: Analyzing trace with hash 272272409, now seen corresponding path program 1 times [2023-11-06 22:45:28,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:45:28,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896628840] [2023-11-06 22:45:28,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:28,187 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:45:28,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:45:28,191 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:28,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:28,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:45:28,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:28,386 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:45:28,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:45:28,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:45:28,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896628840] [2023-11-06 22:45:28,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896628840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:28,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:28,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:45:28,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670896450] [2023-11-06 22:45:28,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:28,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:45:28,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:45:28,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:45:28,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:45:28,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 262 [2023-11-06 22:45:28,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states 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:45:28,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:45:28,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 262 [2023-11-06 22:45:28,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:45:28,828 INFO L124 PetriNetUnfolderBase]: 603/997 cut-off events. [2023-11-06 22:45:28,828 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-11-06 22:45:28,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2106 conditions, 997 events. 603/997 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4840 event pairs, 118 based on Foata normal form. 80/1025 useless extension candidates. Maximal degree in co-relation 2102. Up to 632 conditions per place. [2023-11-06 22:45:28,836 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 30 selfloop transitions, 4 changer transitions 21/59 dead transitions. [2023-11-06 22:45:28,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 59 transitions, 248 flow [2023-11-06 22:45:28,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:45:28,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:45:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-11-06 22:45:28,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.467175572519084 [2023-11-06 22:45:28,841 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-11-06 22:45:28,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-11-06 22:45:28,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:45:28,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-11-06 22:45:28,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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:45:28,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states 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:45:28,852 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states 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:45:28,852 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 612 transitions. [2023-11-06 22:45:28,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 59 transitions, 248 flow [2023-11-06 22:45:28,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 59 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:45:28,855 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 90 flow [2023-11-06 22:45:28,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-11-06 22:45:28,856 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-11-06 22:45:28,857 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 90 flow [2023-11-06 22:45:28,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states 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:45:28,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:45:28,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:28,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:29,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:29,083 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:45:29,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash 963468564, now seen corresponding path program 1 times [2023-11-06 22:45:29,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:45:29,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706774047] [2023-11-06 22:45:29,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:29,086 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:45:29,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:45:29,087 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:29,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:29,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:45:29,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:29,273 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:45:29,274 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:45:29,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:45:29,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706774047] [2023-11-06 22:45:29,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706774047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:29,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:29,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:45:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315700831] [2023-11-06 22:45:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:29,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:45:29,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:45:29,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:45:29,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:45:29,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 262 [2023-11-06 22:45:29,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states 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:45:29,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:45:29,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 262 [2023-11-06 22:45:29,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:45:29,678 INFO L124 PetriNetUnfolderBase]: 264/490 cut-off events. [2023-11-06 22:45:29,678 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-11-06 22:45:29,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1297 conditions, 490 events. 264/490 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2180 event pairs, 72 based on Foata normal form. 44/515 useless extension candidates. Maximal degree in co-relation 1290. Up to 154 conditions per place. [2023-11-06 22:45:29,683 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 39 selfloop transitions, 7 changer transitions 21/71 dead transitions. [2023-11-06 22:45:29,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 71 transitions, 356 flow [2023-11-06 22:45:29,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:45:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:45:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions. [2023-11-06 22:45:29,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675572519083969 [2023-11-06 22:45:29,689 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 735 transitions. [2023-11-06 22:45:29,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions. [2023-11-06 22:45:29,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:45:29,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions. [2023-11-06 22:45:29,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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:45:29,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 262.0) internal successors, (1834), 7 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states 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:45:29,700 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 262.0) internal successors, (1834), 7 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states 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:45:29,700 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 90 flow. Second operand 6 states and 735 transitions. [2023-11-06 22:45:29,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 71 transitions, 356 flow [2023-11-06 22:45:29,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 71 transitions, 350 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:45:29,705 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 140 flow [2023-11-06 22:45:29,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-11-06 22:45:29,706 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-11-06 22:45:29,707 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 140 flow [2023-11-06 22:45:29,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states 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:45:29,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:45:29,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:29,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:29,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:29,920 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:45:29,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:29,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1954419028, now seen corresponding path program 1 times [2023-11-06 22:45:29,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:45:29,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986054934] [2023-11-06 22:45:29,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:29,922 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:45:29,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:45:29,923 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:29,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:30,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:45:30,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:30,116 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:45:30,117 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:45:30,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:45:30,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986054934] [2023-11-06 22:45:30,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986054934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:30,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:30,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:45:30,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547564885] [2023-11-06 22:45:30,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:30,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:45:30,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:45:30,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:45:30,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:45:30,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 262 [2023-11-06 22:45:30,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states 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:45:30,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:45:30,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 262 [2023-11-06 22:45:30,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:45:30,520 INFO L124 PetriNetUnfolderBase]: 168/321 cut-off events. [2023-11-06 22:45:30,520 INFO L125 PetriNetUnfolderBase]: For 310/310 co-relation queries the response was YES. [2023-11-06 22:45:30,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 321 events. 168/321 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1300 event pairs, 68 based on Foata normal form. 11/323 useless extension candidates. Maximal degree in co-relation 908. Up to 129 conditions per place. [2023-11-06 22:45:30,523 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 36 selfloop transitions, 10 changer transitions 11/61 dead transitions. [2023-11-06 22:45:30,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 350 flow [2023-11-06 22:45:30,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:45:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:45:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2023-11-06 22:45:30,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4558342420937841 [2023-11-06 22:45:30,529 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2023-11-06 22:45:30,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2023-11-06 22:45:30,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:45:30,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2023-11-06 22:45:30,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:45:30,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states 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:45:30,548 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states 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:45:30,549 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 140 flow. Second operand 7 states and 836 transitions. [2023-11-06 22:45:30,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 350 flow [2023-11-06 22:45:30,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 314 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-06 22:45:30,559 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 142 flow [2023-11-06 22:45:30,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-11-06 22:45:30,561 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-11-06 22:45:30,562 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 142 flow [2023-11-06 22:45:30,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states 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:45:30,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:45:30,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:30,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:30,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:30,777 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:45:30,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:30,777 INFO L85 PathProgramCache]: Analyzing trace with hash 516033953, now seen corresponding path program 1 times [2023-11-06 22:45:30,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:45:30,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835544440] [2023-11-06 22:45:30,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:30,779 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:45:30,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:45:30,780 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:30,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:30,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:45:30,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:31,367 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:45:31,368 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:45:31,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:45:31,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835544440] [2023-11-06 22:45:31,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835544440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:31,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:31,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:45:31,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053849979] [2023-11-06 22:45:31,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:31,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:45:31,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:45:31,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:45:31,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:45:31,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 262 [2023-11-06 22:45:31,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 142 flow. Second operand has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states 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:45:31,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:45:31,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 262 [2023-11-06 22:45:31,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:45:31,786 INFO L124 PetriNetUnfolderBase]: 181/368 cut-off events. [2023-11-06 22:45:31,786 INFO L125 PetriNetUnfolderBase]: For 398/398 co-relation queries the response was YES. [2023-11-06 22:45:31,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 368 events. 181/368 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1679 event pairs, 17 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 1033. Up to 147 conditions per place. [2023-11-06 22:45:31,790 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 61 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2023-11-06 22:45:31,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 482 flow [2023-11-06 22:45:31,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:45:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:45:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 829 transitions. [2023-11-06 22:45:31,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4520174482006543 [2023-11-06 22:45:31,795 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 829 transitions. [2023-11-06 22:45:31,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 829 transitions. [2023-11-06 22:45:31,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:45:31,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 829 transitions. [2023-11-06 22:45:31,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states 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:45:31,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states 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:45:31,805 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states 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:45:31,805 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 142 flow. Second operand 7 states and 829 transitions. [2023-11-06 22:45:31,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 482 flow [2023-11-06 22:45:31,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 396 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-11-06 22:45:31,812 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 128 flow [2023-11-06 22:45:31,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-11-06 22:45:31,815 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-11-06 22:45:31,816 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 128 flow [2023-11-06 22:45:31,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states 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:45:31,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:45:31,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:31,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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)] Ended with exit code 0 [2023-11-06 22:45:32,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:32,030 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:45:32,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash 471668167, now seen corresponding path program 2 times [2023-11-06 22:45:32,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:45:32,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364748956] [2023-11-06 22:45:32,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:45:32,031 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:45:32,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:45:32,032 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:32,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:32,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:45:32,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:45:32,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:45:32,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:32,192 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:45:32,192 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:45:32,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:45:32,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364748956] [2023-11-06 22:45:32,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364748956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:32,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:32,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:45:32,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716398650] [2023-11-06 22:45:32,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:32,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:45:32,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:45:32,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:45:32,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:45:32,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 262 [2023-11-06 22:45:32,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states 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:45:32,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:45:32,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 262 [2023-11-06 22:45:32,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:45:32,421 INFO L124 PetriNetUnfolderBase]: 318/619 cut-off events. [2023-11-06 22:45:32,421 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2023-11-06 22:45:32,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1784 conditions, 619 events. 318/619 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3179 event pairs, 121 based on Foata normal form. 1/604 useless extension candidates. Maximal degree in co-relation 1775. Up to 332 conditions per place. [2023-11-06 22:45:32,427 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 51 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-06 22:45:32,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 336 flow [2023-11-06 22:45:32,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:45:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:45:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-11-06 22:45:32,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48346055979643765 [2023-11-06 22:45:32,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-11-06 22:45:32,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-11-06 22:45:32,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:45:32,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-11-06 22:45:32,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:45:32,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states 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:45:32,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states 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:45:32,435 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 128 flow. Second operand 3 states and 380 transitions. [2023-11-06 22:45:32,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 336 flow [2023-11-06 22:45:32,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 328 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:45:32,443 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 134 flow [2023-11-06 22:45:32,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-11-06 22:45:32,445 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-11-06 22:45:32,445 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 134 flow [2023-11-06 22:45:32,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states 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:45:32,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:45:32,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:32,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:32,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:32,658 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:45:32,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:32,659 INFO L85 PathProgramCache]: Analyzing trace with hash -118881907, now seen corresponding path program 1 times [2023-11-06 22:45:32,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:45:32,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269278567] [2023-11-06 22:45:32,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:32,660 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:45:32,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:45:32,661 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:32,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:32,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:45:32,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:33,260 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:45:33,260 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:45:33,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:45:33,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269278567] [2023-11-06 22:45:33,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269278567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:45:33,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:45:33,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:45:33,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023434608] [2023-11-06 22:45:33,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:45:33,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:45:33,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:45:33,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:45:33,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:45:33,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 262 [2023-11-06 22:45:33,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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:45:33,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:45:33,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 262 [2023-11-06 22:45:33,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:45:33,758 INFO L124 PetriNetUnfolderBase]: 278/548 cut-off events. [2023-11-06 22:45:33,758 INFO L125 PetriNetUnfolderBase]: For 456/456 co-relation queries the response was YES. [2023-11-06 22:45:33,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1642 conditions, 548 events. 278/548 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2794 event pairs, 31 based on Foata normal form. 4/545 useless extension candidates. Maximal degree in co-relation 1632. Up to 460 conditions per place. [2023-11-06 22:45:33,762 INFO L140 encePairwiseOnDemand]: 258/262 looper letters, 27 selfloop transitions, 3 changer transitions 10/44 dead transitions. [2023-11-06 22:45:33,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 265 flow [2023-11-06 22:45:33,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:45:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:45:33,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2023-11-06 22:45:33,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40381679389312974 [2023-11-06 22:45:33,765 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 529 transitions. [2023-11-06 22:45:33,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 529 transitions. [2023-11-06 22:45:33,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:45:33,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 529 transitions. [2023-11-06 22:45:33,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:45:33,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states 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:45:33,773 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states 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:45:33,773 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 134 flow. Second operand 5 states and 529 transitions. [2023-11-06 22:45:33,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 265 flow [2023-11-06 22:45:33,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:45:33,777 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 122 flow [2023-11-06 22:45:33,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2023-11-06 22:45:33,779 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-11-06 22:45:33,782 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 122 flow [2023-11-06 22:45:33,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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:45:33,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:45:33,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:33,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:45:33,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:33,996 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:45:33,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:33,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1182600471, now seen corresponding path program 3 times [2023-11-06 22:45:33,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:45:33,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726916157] [2023-11-06 22:45:33,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:45:33,997 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:45:33,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:45:33,999 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:34,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:34,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:45:34,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:45:34,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:34,339 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:45:34,339 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:45:34,341 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 22:45:34,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 22:45:34,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 22:45:34,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 22:45:34,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 22:45:34,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 22:45:34,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 22:45:34,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 22:45:34,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 22:45:34,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 22:45:34,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 22:45:34,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 22:45:34,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 22:45:34,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:34,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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:45:34,547 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-11-06 22:45:34,553 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:45:34,553 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:45:34,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:45:34 BasicIcfg [2023-11-06 22:45:34,669 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:45:34,670 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:45:34,670 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:45:34,670 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:45:34,671 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:13" (3/4) ... [2023-11-06 22:45:34,672 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:45:34,673 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:45:34,674 INFO L158 Benchmark]: Toolchain (without parser) took 23374.13ms. Allocated memory was 81.8MB in the beginning and 144.7MB in the end (delta: 62.9MB). Free memory was 56.8MB in the beginning and 31.9MB in the end (delta: 24.9MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. [2023-11-06 22:45:34,674 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 58.7MB. Free memory was 34.9MB in the beginning and 34.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:45:34,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1016.57ms. Allocated memory is still 81.8MB. Free memory was 56.6MB in the beginning and 52.6MB in the end (delta: 4.0MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2023-11-06 22:45:34,675 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.97ms. Allocated memory is still 81.8MB. Free memory was 52.6MB in the beginning and 50.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:45:34,675 INFO L158 Benchmark]: Boogie Preprocessor took 99.86ms. Allocated memory is still 81.8MB. Free memory was 50.1MB in the beginning and 48.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:45:34,676 INFO L158 Benchmark]: RCFGBuilder took 1262.35ms. Allocated memory is still 81.8MB. Free memory was 47.6MB in the beginning and 57.1MB in the end (delta: -9.5MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2023-11-06 22:45:34,676 INFO L158 Benchmark]: TraceAbstraction took 20858.67ms. Allocated memory was 81.8MB in the beginning and 144.7MB in the end (delta: 62.9MB). Free memory was 56.1MB in the beginning and 31.9MB in the end (delta: 24.2MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. [2023-11-06 22:45:34,676 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 144.7MB. Free memory is still 31.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:45:34,678 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.35ms. Allocated memory is still 58.7MB. Free memory was 34.9MB in the beginning and 34.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1016.57ms. Allocated memory is still 81.8MB. Free memory was 56.6MB in the beginning and 52.6MB in the end (delta: 4.0MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.97ms. Allocated memory is still 81.8MB. Free memory was 52.6MB in the beginning and 50.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.86ms. Allocated memory is still 81.8MB. Free memory was 50.1MB in the beginning and 48.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1262.35ms. Allocated memory is still 81.8MB. Free memory was 47.6MB in the beginning and 57.1MB in the end (delta: -9.5MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20858.67ms. Allocated memory was 81.8MB in the beginning and 144.7MB in the end (delta: 62.9MB). Free memory was 56.1MB in the beginning and 31.9MB in the end (delta: 24.2MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 144.7MB. Free memory is still 31.9MB. 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: 11.7s, 135 PlacesBefore, 42 PlacesAfterwards, 128 TransitionsBefore, 33 TransitionsAfterwards, 2784 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 131 TotalNumberOfCompositions, 8206 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3478, independent: 3277, independent conditional: 0, independent unconditional: 3277, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1506, independent: 1462, independent conditional: 0, independent unconditional: 1462, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3478, independent: 1815, independent conditional: 0, independent unconditional: 1815, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 1506, unknown conditional: 0, unknown unconditional: 1506] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t153; [L844] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t153, ((void *)0), P0, ((void *)0))=0, t153={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L845] 0 pthread_t t154; [L846] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t154, ((void *)0), P1, ((void *)0))=1, t153={3:0}, t154={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L786] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L787] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L789] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 0 pthread_t t155; [L848] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t155, ((void *)0), P2, ((void *)0))=2, t153={3:0}, t154={7:0}, t155={11:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L799] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 z$flush_delayed = weak$$choice2 [L808] 3 z$mem_tmp = z [L809] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L810] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L811] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L812] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L813] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L815] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = z [L817] 3 z = z$flush_delayed ? z$mem_tmp : z [L818] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153={3:0}, t154={7:0}, t155={11:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] 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", "mix006_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={5:6}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that 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: 844]: 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: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 159 locations, 13 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: 20.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 326 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 254 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 27 mSDtfsCounter, 1012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=5, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 1085 SizeOfPredicates, 6 NumberOfNonLiveVariables, 939 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:45:34,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37c07a88-a4e8-4783-be95-1fe64586e2b1/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