./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:59:02,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:59:02,450 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:59:02,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:59:02,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:59:02,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:59:02,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:59:02,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:59:02,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:59:02,500 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:59:02,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:59:02,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:59:02,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:59:02,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:59:02,504 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:59:02,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:59:02,505 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:59:02,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:59:02,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:59:02,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:59:02,507 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:59:02,507 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:59:02,508 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:59:02,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:59:02,509 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:59:02,509 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:59:02,509 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:59:02,510 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:59:02,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:59:02,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:59:02,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:59:02,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:59:02,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:59:02,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:59:02,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:59:02,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:59:02,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:59:02,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:59:02,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:59:02,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:59:02,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:59:02,516 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_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 [2023-11-24 21:59:02,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:59:02,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:59:02,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:59:02,880 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:59:02,880 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:59:02,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-11-24 21:59:06,220 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:59:06,663 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:59:06,663 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-11-24 21:59:06,687 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/data/4cd6a970f/3f9d61487b474dbfa07e4659472b47f6/FLAG9f9fb79b2 [2023-11-24 21:59:06,702 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/data/4cd6a970f/3f9d61487b474dbfa07e4659472b47f6 [2023-11-24 21:59:06,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:59:06,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:59:06,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:59:06,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:59:06,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:59:06,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:59:06" (1/1) ... [2023-11-24 21:59:06,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@776dc04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:06, skipping insertion in model container [2023-11-24 21:59:06,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:59:06" (1/1) ... [2023-11-24 21:59:06,767 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:59:07,276 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:59:07,290 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:59:07,393 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:59:07,448 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:59:07,448 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:59:07,458 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:59:07,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:07 WrapperNode [2023-11-24 21:59:07,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:59:07,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:59:07,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:59:07,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:59:07,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:07" (1/1) ... [2023-11-24 21:59:07,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:07" (1/1) ... [2023-11-24 21:59:07,586 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119 [2023-11-24 21:59:07,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:59:07,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:59:07,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:59:07,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:59:07,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:07" (1/1) ... [2023-11-24 21:59:07,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:07" (1/1) ... [2023-11-24 21:59:07,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:07" (1/1) ... [2023-11-24 21:59:07,656 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-24 21:59:07,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:07" (1/1) ... [2023-11-24 21:59:07,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:07" (1/1) ... [2023-11-24 21:59:07,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:07" (1/1) ... [2023-11-24 21:59:07,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:07" (1/1) ... [2023-11-24 21:59:07,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:07" (1/1) ... [2023-11-24 21:59:07,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:07" (1/1) ... [2023-11-24 21:59:07,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:59:07,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:59:07,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:59:07,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:59:07,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:07" (1/1) ... [2023-11-24 21:59:07,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:59:07,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:59:07,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:59:07,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:59:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:59:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:59:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:59:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:59:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:59:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:59:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:59:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:59:07,802 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:59:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:59:07,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:59:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:59:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:59:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:59:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:59:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:59:07,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:59:07,808 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:59:08,014 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:59:08,017 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:59:08,317 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:59:08,628 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:59:08,628 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:59:08,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:59:08 BoogieIcfgContainer [2023-11-24 21:59:08,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:59:08,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:59:08,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:59:08,639 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:59:08,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:59:06" (1/3) ... [2023-11-24 21:59:08,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e95f440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:59:08, skipping insertion in model container [2023-11-24 21:59:08,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:07" (2/3) ... [2023-11-24 21:59:08,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e95f440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:59:08, skipping insertion in model container [2023-11-24 21:59:08,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:59:08" (3/3) ... [2023-11-24 21:59:08,643 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-11-24 21:59:08,663 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:59:08,664 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 21:59:08,664 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:59:08,728 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:59:08,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 92 flow [2023-11-24 21:59:08,801 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-24 21:59:08,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:59:08,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-11-24 21:59:08,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 42 transitions, 92 flow [2023-11-24 21:59:08,814 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 40 transitions, 86 flow [2023-11-24 21:59:08,825 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:59:08,839 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;@21c1109a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:59:08,839 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-24 21:59:08,844 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:59:08,845 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:59:08,845 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:59:08,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:08,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:59:08,846 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:08,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:08,857 INFO L85 PathProgramCache]: Analyzing trace with hash 11697, now seen corresponding path program 1 times [2023-11-24 21:59:08,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:08,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764463312] [2023-11-24 21:59:08,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:08,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:09,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:09,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:09,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764463312] [2023-11-24 21:59:09,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764463312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:09,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:09,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:59:09,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686987563] [2023-11-24 21:59:09,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:09,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:09,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:09,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:09,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:09,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-24 21:59:09,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:09,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:09,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-24 21:59:09,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:09,700 INFO L124 PetriNetUnfolderBase]: 237/558 cut-off events. [2023-11-24 21:59:09,701 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-24 21:59:09,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 558 events. 237/558 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3226 event pairs, 175 based on Foata normal form. 40/536 useless extension candidates. Maximal degree in co-relation 970. Up to 307 conditions per place. [2023-11-24 21:59:09,719 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 24 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-24 21:59:09,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 144 flow [2023-11-24 21:59:09,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:09,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2023-11-24 21:59:09,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2023-11-24 21:59:09,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2023-11-24 21:59:09,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2023-11-24 21:59:09,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:09,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2023-11-24 21:59:09,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:09,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:09,746 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:09,748 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 86 flow. Second operand 3 states and 86 transitions. [2023-11-24 21:59:09,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 144 flow [2023-11-24 21:59:09,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:09,753 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-24 21:59:09,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-24 21:59:09,762 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-24 21:59:09,762 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-24 21:59:09,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:09,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:09,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:59:09,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:59:09,764 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:09,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:09,765 INFO L85 PathProgramCache]: Analyzing trace with hash 11698, now seen corresponding path program 1 times [2023-11-24 21:59:09,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:09,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379181163] [2023-11-24 21:59:09,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:09,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:09,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:09,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379181163] [2023-11-24 21:59:09,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379181163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:09,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:09,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:59:09,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884065148] [2023-11-24 21:59:09,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:09,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:09,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:09,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:09,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:09,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-24 21:59:09,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:09,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:09,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-24 21:59:09,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:10,172 INFO L124 PetriNetUnfolderBase]: 237/557 cut-off events. [2023-11-24 21:59:10,173 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 21:59:10,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 557 events. 237/557 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3217 event pairs, 175 based on Foata normal form. 1/496 useless extension candidates. Maximal degree in co-relation 990. Up to 306 conditions per place. [2023-11-24 21:59:10,179 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 23 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-24 21:59:10,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 142 flow [2023-11-24 21:59:10,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2023-11-24 21:59:10,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2023-11-24 21:59:10,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2023-11-24 21:59:10,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2023-11-24 21:59:10,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:10,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2023-11-24 21:59:10,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:10,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:10,195 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:10,195 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 86 transitions. [2023-11-24 21:59:10,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 142 flow [2023-11-24 21:59:10,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:10,203 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-24 21:59:10,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-24 21:59:10,207 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-24 21:59:10,208 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-24 21:59:10,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:10,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:10,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:59:10,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:59:10,210 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:10,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:10,216 INFO L85 PathProgramCache]: Analyzing trace with hash 348783347, now seen corresponding path program 1 times [2023-11-24 21:59:10,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:10,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975330140] [2023-11-24 21:59:10,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:10,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:10,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:10,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975330140] [2023-11-24 21:59:10,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975330140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:10,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:10,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:59:10,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392810190] [2023-11-24 21:59:10,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:10,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:10,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:10,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:10,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:10,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-24 21:59:10,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:10,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:10,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-24 21:59:10,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:10,563 INFO L124 PetriNetUnfolderBase]: 241/552 cut-off events. [2023-11-24 21:59:10,564 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 21:59:10,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 552 events. 241/552 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3153 event pairs, 183 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 994. Up to 309 conditions per place. [2023-11-24 21:59:10,569 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 24 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-24 21:59:10,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 142 flow [2023-11-24 21:59:10,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-24 21:59:10,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-24 21:59:10,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-24 21:59:10,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-24 21:59:10,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:10,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-24 21:59:10,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:10,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:10,575 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:10,575 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 84 transitions. [2023-11-24 21:59:10,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 142 flow [2023-11-24 21:59:10,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:10,578 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-24 21:59:10,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-11-24 21:59:10,580 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-24 21:59:10,581 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-24 21:59:10,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:10,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:10,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:59:10,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:59:10,582 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:10,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:10,582 INFO L85 PathProgramCache]: Analyzing trace with hash 348783348, now seen corresponding path program 1 times [2023-11-24 21:59:10,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:10,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460448706] [2023-11-24 21:59:10,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:10,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:10,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:10,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460448706] [2023-11-24 21:59:10,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460448706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:10,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:10,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:59:10,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440933530] [2023-11-24 21:59:10,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:10,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:10,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:10,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:10,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:10,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-24 21:59:10,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:10,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:10,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-24 21:59:10,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:10,867 INFO L124 PetriNetUnfolderBase]: 237/547 cut-off events. [2023-11-24 21:59:10,867 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-24 21:59:10,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 547 events. 237/547 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3172 event pairs, 107 based on Foata normal form. 5/503 useless extension candidates. Maximal degree in co-relation 985. Up to 300 conditions per place. [2023-11-24 21:59:10,873 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 23 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-11-24 21:59:10,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 138 flow [2023-11-24 21:59:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2023-11-24 21:59:10,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2023-11-24 21:59:10,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2023-11-24 21:59:10,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2023-11-24 21:59:10,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:10,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2023-11-24 21:59:10,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:10,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:10,879 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:10,879 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 86 transitions. [2023-11-24 21:59:10,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 138 flow [2023-11-24 21:59:10,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:10,882 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 74 flow [2023-11-24 21:59:10,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-11-24 21:59:10,884 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-11-24 21:59:10,884 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 74 flow [2023-11-24 21:59:10,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:10,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:10,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:59:10,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:59:10,886 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:10,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash 348784593, now seen corresponding path program 1 times [2023-11-24 21:59:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:10,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597917722] [2023-11-24 21:59:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:11,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:11,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597917722] [2023-11-24 21:59:11,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597917722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:11,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:11,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:59:11,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223891971] [2023-11-24 21:59:11,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:11,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:11,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:11,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:11,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:11,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2023-11-24 21:59:11,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:11,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:11,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2023-11-24 21:59:11,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:11,191 INFO L124 PetriNetUnfolderBase]: 183/393 cut-off events. [2023-11-24 21:59:11,193 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-24 21:59:11,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 393 events. 183/393 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1952 event pairs, 69 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 736. Up to 265 conditions per place. [2023-11-24 21:59:11,197 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 25 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2023-11-24 21:59:11,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 160 flow [2023-11-24 21:59:11,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2023-11-24 21:59:11,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2023-11-24 21:59:11,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 93 transitions. [2023-11-24 21:59:11,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 93 transitions. [2023-11-24 21:59:11,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:11,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 93 transitions. [2023-11-24 21:59:11,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:11,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:11,203 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:11,203 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 74 flow. Second operand 3 states and 93 transitions. [2023-11-24 21:59:11,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 160 flow [2023-11-24 21:59:11,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:11,205 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2023-11-24 21:59:11,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-11-24 21:59:11,207 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2023-11-24 21:59:11,207 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2023-11-24 21:59:11,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:11,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:11,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:11,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:59:11,208 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:11,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:11,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2029469122, now seen corresponding path program 1 times [2023-11-24 21:59:11,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:11,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820455720] [2023-11-24 21:59:11,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:11,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:11,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:11,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:11,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820455720] [2023-11-24 21:59:11,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820455720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:11,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:11,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:59:11,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197739427] [2023-11-24 21:59:11,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:11,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:59:11,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:11,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:59:11,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:59:11,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-24 21:59:11,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 flow. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:11,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:11,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-24 21:59:11,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:11,903 INFO L124 PetriNetUnfolderBase]: 204/409 cut-off events. [2023-11-24 21:59:11,904 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-24 21:59:11,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 409 events. 204/409 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1944 event pairs, 12 based on Foata normal form. 20/425 useless extension candidates. Maximal degree in co-relation 802. Up to 248 conditions per place. [2023-11-24 21:59:11,908 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 25 selfloop transitions, 3 changer transitions 9/49 dead transitions. [2023-11-24 21:59:11,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 186 flow [2023-11-24 21:59:11,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:59:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:59:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2023-11-24 21:59:11,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5793650793650794 [2023-11-24 21:59:11,911 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 146 transitions. [2023-11-24 21:59:11,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 146 transitions. [2023-11-24 21:59:11,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:11,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 146 transitions. [2023-11-24 21:59:11,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:11,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:11,915 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:11,915 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 6 states and 146 transitions. [2023-11-24 21:59:11,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 186 flow [2023-11-24 21:59:11,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:11,919 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 68 flow [2023-11-24 21:59:11,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-11-24 21:59:11,922 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-11-24 21:59:11,922 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 68 flow [2023-11-24 21:59:11,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:11,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:11,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:11,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:59:11,923 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:11,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:11,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2029470521, now seen corresponding path program 1 times [2023-11-24 21:59:11,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:11,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225656670] [2023-11-24 21:59:11,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:11,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:12,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:12,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225656670] [2023-11-24 21:59:12,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225656670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:12,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:12,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:59:12,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215705719] [2023-11-24 21:59:12,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:12,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:59:12,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:12,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:59:12,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:59:12,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-24 21:59:12,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:12,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:12,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-24 21:59:12,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:12,479 INFO L124 PetriNetUnfolderBase]: 284/577 cut-off events. [2023-11-24 21:59:12,479 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-24 21:59:12,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1120 conditions, 577 events. 284/577 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3072 event pairs, 51 based on Foata normal form. 0/555 useless extension candidates. Maximal degree in co-relation 1109. Up to 281 conditions per place. [2023-11-24 21:59:12,484 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 21 selfloop transitions, 2 changer transitions 32/66 dead transitions. [2023-11-24 21:59:12,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 256 flow [2023-11-24 21:59:12,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:59:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:59:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2023-11-24 21:59:12,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5982142857142857 [2023-11-24 21:59:12,486 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 201 transitions. [2023-11-24 21:59:12,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 201 transitions. [2023-11-24 21:59:12,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:12,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 201 transitions. [2023-11-24 21:59:12,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:12,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:12,489 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:12,489 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 68 flow. Second operand 8 states and 201 transitions. [2023-11-24 21:59:12,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 256 flow [2023-11-24 21:59:12,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 66 transitions, 249 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:59:12,491 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 77 flow [2023-11-24 21:59:12,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=77, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2023-11-24 21:59:12,492 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-11-24 21:59:12,493 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 77 flow [2023-11-24 21:59:12,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:12,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:12,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:12,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:59:12,494 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:12,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:12,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1867353102, now seen corresponding path program 1 times [2023-11-24 21:59:12,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:12,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701702656] [2023-11-24 21:59:12,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:12,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:12,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:12,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701702656] [2023-11-24 21:59:12,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701702656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:12,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:12,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:59:12,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062864065] [2023-11-24 21:59:12,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:12,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:59:12,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:12,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:59:12,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:59:12,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-24 21:59:12,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:12,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:12,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-24 21:59:12,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:12,796 INFO L124 PetriNetUnfolderBase]: 198/427 cut-off events. [2023-11-24 21:59:12,796 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-24 21:59:12,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 427 events. 198/427 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1964 event pairs, 38 based on Foata normal form. 25/441 useless extension candidates. Maximal degree in co-relation 885. Up to 191 conditions per place. [2023-11-24 21:59:12,800 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 31 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2023-11-24 21:59:12,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 187 flow [2023-11-24 21:59:12,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:59:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:59:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2023-11-24 21:59:12,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2023-11-24 21:59:12,802 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 110 transitions. [2023-11-24 21:59:12,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 110 transitions. [2023-11-24 21:59:12,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:12,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 110 transitions. [2023-11-24 21:59:12,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:12,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:12,804 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:12,804 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 77 flow. Second operand 4 states and 110 transitions. [2023-11-24 21:59:12,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 187 flow [2023-11-24 21:59:12,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 175 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-24 21:59:12,808 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 91 flow [2023-11-24 21:59:12,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-11-24 21:59:12,809 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-11-24 21:59:12,809 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 91 flow [2023-11-24 21:59:12,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:12,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:12,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:12,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:59:12,810 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:12,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1595607176, now seen corresponding path program 1 times [2023-11-24 21:59:12,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:12,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656750254] [2023-11-24 21:59:12,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:12,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:13,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:13,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656750254] [2023-11-24 21:59:13,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656750254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:13,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:13,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:59:13,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106712465] [2023-11-24 21:59:13,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:13,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:59:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:13,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:59:13,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:59:13,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-24 21:59:13,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:13,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:13,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-24 21:59:13,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:13,155 INFO L124 PetriNetUnfolderBase]: 102/226 cut-off events. [2023-11-24 21:59:13,155 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-11-24 21:59:13,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 226 events. 102/226 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 743 event pairs, 26 based on Foata normal form. 16/234 useless extension candidates. Maximal degree in co-relation 520. Up to 86 conditions per place. [2023-11-24 21:59:13,158 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 26 selfloop transitions, 6 changer transitions 1/43 dead transitions. [2023-11-24 21:59:13,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 188 flow [2023-11-24 21:59:13,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:59:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:59:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2023-11-24 21:59:13,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2023-11-24 21:59:13,159 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 125 transitions. [2023-11-24 21:59:13,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 125 transitions. [2023-11-24 21:59:13,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:13,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 125 transitions. [2023-11-24 21:59:13,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:13,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:13,162 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:13,162 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 91 flow. Second operand 5 states and 125 transitions. [2023-11-24 21:59:13,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 188 flow [2023-11-24 21:59:13,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 175 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-24 21:59:13,164 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 103 flow [2023-11-24 21:59:13,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-11-24 21:59:13,165 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-24 21:59:13,166 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 103 flow [2023-11-24 21:59:13,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:13,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:13,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:13,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:59:13,167 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:13,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:13,167 INFO L85 PathProgramCache]: Analyzing trace with hash 822868195, now seen corresponding path program 1 times [2023-11-24 21:59:13,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:13,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164439054] [2023-11-24 21:59:13,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:13,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:14,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:14,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164439054] [2023-11-24 21:59:14,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164439054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:14,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:14,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:59:14,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025243660] [2023-11-24 21:59:14,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:14,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:59:14,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:14,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:59:14,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:59:14,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-24 21:59:14,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 103 flow. Second operand has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:14,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:14,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-24 21:59:14,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:14,445 INFO L124 PetriNetUnfolderBase]: 116/269 cut-off events. [2023-11-24 21:59:14,445 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2023-11-24 21:59:14,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 269 events. 116/269 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1017 event pairs, 14 based on Foata normal form. 4/266 useless extension candidates. Maximal degree in co-relation 627. Up to 61 conditions per place. [2023-11-24 21:59:14,447 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 28 selfloop transitions, 8 changer transitions 18/66 dead transitions. [2023-11-24 21:59:14,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 298 flow [2023-11-24 21:59:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:59:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:59:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 225 transitions. [2023-11-24 21:59:14,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2023-11-24 21:59:14,450 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 225 transitions. [2023-11-24 21:59:14,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 225 transitions. [2023-11-24 21:59:14,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:14,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 225 transitions. [2023-11-24 21:59:14,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:14,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 42.0) internal successors, (462), 11 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:14,453 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 42.0) internal successors, (462), 11 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:14,453 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 103 flow. Second operand 10 states and 225 transitions. [2023-11-24 21:59:14,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 298 flow [2023-11-24 21:59:14,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 264 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-24 21:59:14,456 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 121 flow [2023-11-24 21:59:14,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=121, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2023-11-24 21:59:14,457 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2023-11-24 21:59:14,457 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 121 flow [2023-11-24 21:59:14,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:14,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:14,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:14,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:59:14,458 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:14,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:14,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1766657077, now seen corresponding path program 2 times [2023-11-24 21:59:14,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:14,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001641899] [2023-11-24 21:59:14,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:14,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:14,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:14,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001641899] [2023-11-24 21:59:14,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001641899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:14,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:14,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:59:14,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282412491] [2023-11-24 21:59:14,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:14,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:59:14,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:14,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:59:14,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:59:14,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-24 21:59:14,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:14,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:14,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-24 21:59:14,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:15,072 INFO L124 PetriNetUnfolderBase]: 132/316 cut-off events. [2023-11-24 21:59:15,072 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-24 21:59:15,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 316 events. 132/316 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1284 event pairs, 50 based on Foata normal form. 4/306 useless extension candidates. Maximal degree in co-relation 741. Up to 131 conditions per place. [2023-11-24 21:59:15,076 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 18 selfloop transitions, 1 changer transitions 22/53 dead transitions. [2023-11-24 21:59:15,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 259 flow [2023-11-24 21:59:15,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:59:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:59:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2023-11-24 21:59:15,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2023-11-24 21:59:15,078 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 140 transitions. [2023-11-24 21:59:15,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 140 transitions. [2023-11-24 21:59:15,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:15,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 140 transitions. [2023-11-24 21:59:15,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:15,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:15,081 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:15,081 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 121 flow. Second operand 6 states and 140 transitions. [2023-11-24 21:59:15,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 259 flow [2023-11-24 21:59:15,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 239 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-24 21:59:15,085 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 101 flow [2023-11-24 21:59:15,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2023-11-24 21:59:15,086 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-11-24 21:59:15,086 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 101 flow [2023-11-24 21:59:15,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:15,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:15,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:15,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:59:15,087 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:15,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:15,088 INFO L85 PathProgramCache]: Analyzing trace with hash 374496741, now seen corresponding path program 3 times [2023-11-24 21:59:15,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:15,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471116381] [2023-11-24 21:59:15,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:15,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:59:15,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:59:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:59:15,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 21:59:15,301 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:59:15,302 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-24 21:59:15,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-24 21:59:15,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-24 21:59:15,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-24 21:59:15,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-24 21:59:15,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-24 21:59:15,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-24 21:59:15,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-24 21:59:15,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-24 21:59:15,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-24 21:59:15,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:59:15,307 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:15,316 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:59:15,316 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:59:15,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:59:15,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:59:15,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:59:15,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:59:15,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:59:15 BasicIcfg [2023-11-24 21:59:15,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:59:15,450 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:59:15,450 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:59:15,450 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:59:15,451 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:59:08" (3/4) ... [2023-11-24 21:59:15,453 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:59:15,455 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:59:15,455 INFO L158 Benchmark]: Toolchain (without parser) took 8748.59ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 129.2MB in the beginning and 76.4MB in the end (delta: 52.9MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. [2023-11-24 21:59:15,456 INFO L158 Benchmark]: CDTParser took 2.11ms. Allocated memory is still 119.5MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:59:15,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 751.67ms. Allocated memory is still 159.4MB. Free memory was 129.2MB in the beginning and 106.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 21:59:15,457 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.78ms. Allocated memory is still 159.4MB. Free memory was 106.1MB in the beginning and 104.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:59:15,457 INFO L158 Benchmark]: Boogie Preprocessor took 111.75ms. Allocated memory is still 159.4MB. Free memory was 103.7MB in the beginning and 100.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:59:15,458 INFO L158 Benchmark]: RCFGBuilder took 932.54ms. Allocated memory is still 159.4MB. Free memory was 100.5MB in the beginning and 114.6MB in the end (delta: -14.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-24 21:59:15,458 INFO L158 Benchmark]: TraceAbstraction took 6814.85ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 114.6MB in the beginning and 76.4MB in the end (delta: 38.3MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. [2023-11-24 21:59:15,459 INFO L158 Benchmark]: Witness Printer took 4.78ms. Allocated memory is still 192.9MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:59:15,461 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.11ms. Allocated memory is still 119.5MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 751.67ms. Allocated memory is still 159.4MB. Free memory was 129.2MB in the beginning and 106.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.78ms. Allocated memory is still 159.4MB. Free memory was 106.1MB in the beginning and 104.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.75ms. Allocated memory is still 159.4MB. Free memory was 103.7MB in the beginning and 100.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 932.54ms. Allocated memory is still 159.4MB. Free memory was 100.5MB in the beginning and 114.6MB in the end (delta: -14.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6814.85ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 114.6MB in the beginning and 76.4MB in the end (delta: 38.3MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. * Witness Printer took 4.78ms. Allocated memory is still 192.9MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L721] 0 _Bool y$flush_delayed; [L722] 0 int y$mem_tmp; [L723] 0 _Bool y$r_buff0_thd0; [L724] 0 _Bool y$r_buff0_thd1; [L725] 0 _Bool y$r_buff0_thd2; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$read_delayed; [L730] 0 int *y$read_delayed_var; [L731] 0 int y$w_buff0; [L732] 0 _Bool y$w_buff0_used; [L733] 0 int y$w_buff1; [L734] 0 _Bool y$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L812] 0 pthread_t t305; [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L814] 0 pthread_t t306; [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L830] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L17] 0 __assert_fail ("0", "mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 815]: 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: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 59 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 375 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 318 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 956 IncrementalHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 20 mSDtfsCounter, 956 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=10, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 736 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-24 21:59:15,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:59:18,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:59:18,791 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 21:59:18,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:59:18,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:59:18,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:59:18,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:59:18,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:59:18,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:59:18,863 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:59:18,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:59:18,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:59:18,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:59:18,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:59:18,867 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:59:18,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:59:18,869 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:59:18,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:59:18,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:59:18,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:59:18,872 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:59:18,873 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:59:18,873 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:59:18,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:59:18,874 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:59:18,875 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 21:59:18,875 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 21:59:18,876 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:59:18,876 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:59:18,877 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:59:18,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:59:18,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:59:18,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:59:18,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:59:18,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:59:18,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:59:18,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:59:18,882 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 21:59:18,883 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 21:59:18,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:59:18,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:59:18,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:59:18,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:59:18,885 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 21:59:18,886 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_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 [2023-11-24 21:59:19,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:59:19,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:59:19,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:59:19,399 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:59:19,400 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:59:19,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-11-24 21:59:22,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:59:23,251 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:59:23,271 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-11-24 21:59:23,291 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/data/083edaafc/8d9e479c75ac4eceb2dc1c959dd45d6d/FLAG04ed9db99 [2023-11-24 21:59:23,309 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/data/083edaafc/8d9e479c75ac4eceb2dc1c959dd45d6d [2023-11-24 21:59:23,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:59:23,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:59:23,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:59:23,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:59:23,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:59:23,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:59:23" (1/1) ... [2023-11-24 21:59:23,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd91107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:23, skipping insertion in model container [2023-11-24 21:59:23,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:59:23" (1/1) ... [2023-11-24 21:59:23,397 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:59:24,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:59:24,133 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:59:24,239 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:59:24,390 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:59:24,390 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:59:24,413 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:59:24,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:24 WrapperNode [2023-11-24 21:59:24,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:59:24,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:59:24,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:59:24,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:59:24,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:24" (1/1) ... [2023-11-24 21:59:24,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:24" (1/1) ... [2023-11-24 21:59:24,523 INFO L138 Inliner]: procedures = 178, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2023-11-24 21:59:24,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:59:24,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:59:24,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:59:24,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:59:24,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:24" (1/1) ... [2023-11-24 21:59:24,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:24" (1/1) ... [2023-11-24 21:59:24,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:24" (1/1) ... [2023-11-24 21:59:24,606 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-24 21:59:24,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:24" (1/1) ... [2023-11-24 21:59:24,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:24" (1/1) ... [2023-11-24 21:59:24,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:24" (1/1) ... [2023-11-24 21:59:24,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:24" (1/1) ... [2023-11-24 21:59:24,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:24" (1/1) ... [2023-11-24 21:59:24,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:24" (1/1) ... [2023-11-24 21:59:24,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:59:24,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:59:24,658 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:59:24,658 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:59:24,659 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:24" (1/1) ... [2023-11-24 21:59:24,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:59:24,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:59:24,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:59:24,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:59:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:59:24,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:59:24,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:59:24,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:59:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-24 21:59:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-24 21:59:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-24 21:59:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-24 21:59:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-24 21:59:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-24 21:59:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:59:24,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:59:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:59:24,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:59:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:59:24,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:59:24,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:59:24,768 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:59:24,963 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:59:24,966 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:59:25,483 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:59:25,864 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:59:25,865 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:59:25,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:59:25 BoogieIcfgContainer [2023-11-24 21:59:25,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:59:25,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:59:25,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:59:25,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:59:25,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:59:23" (1/3) ... [2023-11-24 21:59:25,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce46938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:59:25, skipping insertion in model container [2023-11-24 21:59:25,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:24" (2/3) ... [2023-11-24 21:59:25,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce46938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:59:25, skipping insertion in model container [2023-11-24 21:59:25,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:59:25" (3/3) ... [2023-11-24 21:59:25,880 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-11-24 21:59:25,903 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:59:25,904 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 21:59:25,904 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:59:26,001 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:59:26,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 92 flow [2023-11-24 21:59:26,088 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-24 21:59:26,088 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:59:26,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-11-24 21:59:26,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 42 transitions, 92 flow [2023-11-24 21:59:26,102 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 40 transitions, 86 flow [2023-11-24 21:59:26,130 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:59:26,138 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;@452fb156, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:59:26,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-24 21:59:26,143 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:59:26,143 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:59:26,143 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:59:26,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:26,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:59:26,145 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:26,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:26,151 INFO L85 PathProgramCache]: Analyzing trace with hash 11761, now seen corresponding path program 1 times [2023-11-24 21:59:26,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:26,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153200821] [2023-11-24 21:59:26,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:26,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:26,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:26,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:59:26,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-24 21:59:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:26,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:59:26,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:59:26,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-24 21:59:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:26,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:59:26,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:59:26,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153200821] [2023-11-24 21:59:26,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153200821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:26,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:26,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:59:26,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705915786] [2023-11-24 21:59:26,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:26,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:26,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:59:26,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:26,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:26,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-24 21:59:26,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:26,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:26,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-24 21:59:26,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:26,953 INFO L124 PetriNetUnfolderBase]: 237/558 cut-off events. [2023-11-24 21:59:26,953 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-24 21:59:26,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 558 events. 237/558 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3226 event pairs, 175 based on Foata normal form. 40/536 useless extension candidates. Maximal degree in co-relation 970. Up to 307 conditions per place. [2023-11-24 21:59:26,969 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 24 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-24 21:59:26,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 144 flow [2023-11-24 21:59:26,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2023-11-24 21:59:26,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2023-11-24 21:59:26,989 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2023-11-24 21:59:26,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2023-11-24 21:59:26,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:26,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2023-11-24 21:59:26,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:27,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:27,008 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:27,011 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 86 flow. Second operand 3 states and 86 transitions. [2023-11-24 21:59:27,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 144 flow [2023-11-24 21:59:27,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:27,022 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-24 21:59:27,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-24 21:59:27,030 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-24 21:59:27,030 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-24 21:59:27,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:27,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:27,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:59:27,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-24 21:59:27,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:27,234 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:27,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:27,235 INFO L85 PathProgramCache]: Analyzing trace with hash 11762, now seen corresponding path program 1 times [2023-11-24 21:59:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:27,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723068252] [2023-11-24 21:59:27,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:27,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:27,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:27,240 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:59:27,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-24 21:59:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:27,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:59:27,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:59:27,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 21:59:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:27,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:59:27,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:59:27,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723068252] [2023-11-24 21:59:27,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723068252] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:27,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:27,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:59:27,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255873348] [2023-11-24 21:59:27,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:27,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:27,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:59:27,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:27,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:27,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-24 21:59:27,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:27,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:27,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-24 21:59:27,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:27,671 INFO L124 PetriNetUnfolderBase]: 237/557 cut-off events. [2023-11-24 21:59:27,672 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 21:59:27,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 557 events. 237/557 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3217 event pairs, 175 based on Foata normal form. 1/496 useless extension candidates. Maximal degree in co-relation 990. Up to 306 conditions per place. [2023-11-24 21:59:27,684 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 23 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-24 21:59:27,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 142 flow [2023-11-24 21:59:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2023-11-24 21:59:27,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2023-11-24 21:59:27,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2023-11-24 21:59:27,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2023-11-24 21:59:27,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:27,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2023-11-24 21:59:27,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:27,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:27,706 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:27,706 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 86 transitions. [2023-11-24 21:59:27,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 142 flow [2023-11-24 21:59:27,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:27,713 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-24 21:59:27,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-24 21:59:27,714 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-24 21:59:27,715 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-24 21:59:27,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:27,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:27,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:59:27,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-24 21:59:27,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:27,919 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:27,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:27,920 INFO L85 PathProgramCache]: Analyzing trace with hash 350691957, now seen corresponding path program 1 times [2023-11-24 21:59:27,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:27,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113618958] [2023-11-24 21:59:27,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:27,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:27,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:27,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:59:27,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-24 21:59:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:28,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:59:28,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:59:28,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-24 21:59:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:28,085 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:59:28,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:59:28,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113618958] [2023-11-24 21:59:28,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113618958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:28,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:28,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:59:28,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767642386] [2023-11-24 21:59:28,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:28,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:28,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:59:28,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:28,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:28,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-24 21:59:28,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:28,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:28,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-24 21:59:28,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:28,328 INFO L124 PetriNetUnfolderBase]: 241/552 cut-off events. [2023-11-24 21:59:28,328 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 21:59:28,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 552 events. 241/552 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3153 event pairs, 183 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 994. Up to 309 conditions per place. [2023-11-24 21:59:28,334 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 24 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-24 21:59:28,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 142 flow [2023-11-24 21:59:28,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-24 21:59:28,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-24 21:59:28,337 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-24 21:59:28,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-24 21:59:28,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:28,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-24 21:59:28,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:28,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:28,339 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:28,340 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 84 transitions. [2023-11-24 21:59:28,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 142 flow [2023-11-24 21:59:28,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:28,343 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-24 21:59:28,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-11-24 21:59:28,344 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-24 21:59:28,344 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-24 21:59:28,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:28,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:28,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:59:28,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-24 21:59:28,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:28,548 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:28,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:28,549 INFO L85 PathProgramCache]: Analyzing trace with hash 350691958, now seen corresponding path program 1 times [2023-11-24 21:59:28,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:28,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062234705] [2023-11-24 21:59:28,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:28,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:28,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:28,551 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:59:28,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-24 21:59:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:28,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:59:28,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:59:28,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 21:59:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:28,706 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:59:28,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:59:28,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062234705] [2023-11-24 21:59:28,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062234705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:28,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:28,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:59:28,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886953934] [2023-11-24 21:59:28,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:28,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:28,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:59:28,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:28,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:28,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-24 21:59:28,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:28,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:28,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-24 21:59:28,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:28,937 INFO L124 PetriNetUnfolderBase]: 237/547 cut-off events. [2023-11-24 21:59:28,937 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-24 21:59:28,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 547 events. 237/547 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3172 event pairs, 107 based on Foata normal form. 5/503 useless extension candidates. Maximal degree in co-relation 985. Up to 300 conditions per place. [2023-11-24 21:59:28,944 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 23 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-11-24 21:59:28,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 138 flow [2023-11-24 21:59:28,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2023-11-24 21:59:28,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2023-11-24 21:59:28,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2023-11-24 21:59:28,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2023-11-24 21:59:28,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:28,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2023-11-24 21:59:28,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:28,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:28,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:28,959 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 86 transitions. [2023-11-24 21:59:28,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 138 flow [2023-11-24 21:59:28,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:28,965 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 74 flow [2023-11-24 21:59:28,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-11-24 21:59:28,968 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-11-24 21:59:28,968 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 74 flow [2023-11-24 21:59:28,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:28,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:28,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:59:28,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-24 21:59:29,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:29,177 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:29,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash 350693203, now seen corresponding path program 1 times [2023-11-24 21:59:29,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:29,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965248124] [2023-11-24 21:59:29,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:29,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:29,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:29,181 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:59:29,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-24 21:59:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:29,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 21:59:29,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:59:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:29,299 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:59:29,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:59:29,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965248124] [2023-11-24 21:59:29,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965248124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:29,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:29,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:59:29,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070414733] [2023-11-24 21:59:29,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:29,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:29,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:59:29,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:29,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:29,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2023-11-24 21:59:29,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:29,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:29,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2023-11-24 21:59:29,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:29,468 INFO L124 PetriNetUnfolderBase]: 183/416 cut-off events. [2023-11-24 21:59:29,468 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-24 21:59:29,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 416 events. 183/416 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2184 event pairs, 21 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 759. Up to 265 conditions per place. [2023-11-24 21:59:29,472 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 25 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2023-11-24 21:59:29,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 160 flow [2023-11-24 21:59:29,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2023-11-24 21:59:29,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2023-11-24 21:59:29,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 93 transitions. [2023-11-24 21:59:29,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 93 transitions. [2023-11-24 21:59:29,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:29,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 93 transitions. [2023-11-24 21:59:29,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:29,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:29,477 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:29,477 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 74 flow. Second operand 3 states and 93 transitions. [2023-11-24 21:59:29,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 160 flow [2023-11-24 21:59:29,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:29,480 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2023-11-24 21:59:29,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-11-24 21:59:29,481 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2023-11-24 21:59:29,482 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2023-11-24 21:59:29,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:29,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:29,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:29,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-24 21:59:29,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:29,685 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:29,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:29,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1422771204, now seen corresponding path program 1 times [2023-11-24 21:59:29,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:29,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200755019] [2023-11-24 21:59:29,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:29,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:29,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:29,688 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:59:29,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-24 21:59:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:29,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:59:29,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:59:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:29,879 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:59:29,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:59:29,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200755019] [2023-11-24 21:59:29,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200755019] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:29,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:29,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:59:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584372572] [2023-11-24 21:59:29,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:29,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:59:29,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:59:29,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:59:29,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:59:29,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-24 21:59:29,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:29,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:29,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-24 21:59:29,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:30,132 INFO L124 PetriNetUnfolderBase]: 220/497 cut-off events. [2023-11-24 21:59:30,132 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-11-24 21:59:30,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 497 events. 220/497 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2502 event pairs, 38 based on Foata normal form. 25/511 useless extension candidates. Maximal degree in co-relation 933. Up to 229 conditions per place. [2023-11-24 21:59:30,138 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 32 selfloop transitions, 4 changer transitions 1/49 dead transitions. [2023-11-24 21:59:30,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 186 flow [2023-11-24 21:59:30,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:59:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:59:30,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2023-11-24 21:59:30,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2023-11-24 21:59:30,141 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 111 transitions. [2023-11-24 21:59:30,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 111 transitions. [2023-11-24 21:59:30,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:30,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 111 transitions. [2023-11-24 21:59:30,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:30,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:30,146 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:30,147 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 4 states and 111 transitions. [2023-11-24 21:59:30,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 186 flow [2023-11-24 21:59:30,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:30,151 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 92 flow [2023-11-24 21:59:30,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-11-24 21:59:30,156 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-24 21:59:30,157 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 92 flow [2023-11-24 21:59:30,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:30,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:30,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:30,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-24 21:59:30,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:30,362 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:30,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:30,362 INFO L85 PathProgramCache]: Analyzing trace with hash 341156573, now seen corresponding path program 1 times [2023-11-24 21:59:30,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:30,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087794768] [2023-11-24 21:59:30,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:30,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:30,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:30,365 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:59:30,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-24 21:59:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:30,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:59:30,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:59:30,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-24 21:59:30,581 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:59:30,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:59:30,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087794768] [2023-11-24 21:59:30,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087794768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:30,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:30,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:59:30,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727060728] [2023-11-24 21:59:30,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:30,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:59:30,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:59:30,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:59:30,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:59:30,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-24 21:59:30,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:30,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:30,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-24 21:59:30,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:30,801 INFO L124 PetriNetUnfolderBase]: 106/242 cut-off events. [2023-11-24 21:59:30,801 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-11-24 21:59:30,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 242 events. 106/242 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 821 event pairs, 26 based on Foata normal form. 16/250 useless extension candidates. Maximal degree in co-relation 534. Up to 86 conditions per place. [2023-11-24 21:59:30,804 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 27 selfloop transitions, 6 changer transitions 1/46 dead transitions. [2023-11-24 21:59:30,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 191 flow [2023-11-24 21:59:30,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:59:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:59:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2023-11-24 21:59:30,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2023-11-24 21:59:30,807 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 126 transitions. [2023-11-24 21:59:30,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 126 transitions. [2023-11-24 21:59:30,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:30,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 126 transitions. [2023-11-24 21:59:30,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:30,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:30,810 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:30,810 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 92 flow. Second operand 5 states and 126 transitions. [2023-11-24 21:59:30,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 191 flow [2023-11-24 21:59:30,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 182 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:30,814 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 108 flow [2023-11-24 21:59:30,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-11-24 21:59:30,815 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2023-11-24 21:59:30,816 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 108 flow [2023-11-24 21:59:30,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:30,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:30,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:30,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-24 21:59:31,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:31,021 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:31,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:31,022 INFO L85 PathProgramCache]: Analyzing trace with hash 600643244, now seen corresponding path program 1 times [2023-11-24 21:59:31,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:31,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525371562] [2023-11-24 21:59:31,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:31,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:31,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:31,045 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:59:31,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-24 21:59:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:31,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-24 21:59:31,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:59:31,684 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t306~0#1.base_47| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t305~0#1.base_51| (_ BitVec 32))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t305~0#1.base_51| (_ bv0 1)) |v_ULTIMATE.start_main_~#t306~0#1.base_47| (_ bv0 1))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t305~0#1.base_51| (_ bv1 1)) |v_ULTIMATE.start_main_~#t306~0#1.base_47|) (_ bv0 1)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t305~0#1.base_51|)))) is different from true [2023-11-24 21:59:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:31,686 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:59:31,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:59:31,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525371562] [2023-11-24 21:59:31,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525371562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:31,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:31,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:59:31,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249093811] [2023-11-24 21:59:31,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:31,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:59:31,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:59:31,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:59:31,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-24 21:59:31,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2023-11-24 21:59:31,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:31,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:31,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2023-11-24 21:59:31,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:31,894 INFO L124 PetriNetUnfolderBase]: 66/181 cut-off events. [2023-11-24 21:59:31,895 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-24 21:59:31,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 181 events. 66/181 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 609 event pairs, 47 based on Foata normal form. 4/177 useless extension candidates. Maximal degree in co-relation 388. Up to 117 conditions per place. [2023-11-24 21:59:31,897 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 21 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2023-11-24 21:59:31,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 40 transitions, 174 flow [2023-11-24 21:59:31,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:59:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:59:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2023-11-24 21:59:31,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2023-11-24 21:59:31,900 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 97 transitions. [2023-11-24 21:59:31,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 97 transitions. [2023-11-24 21:59:31,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:31,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 97 transitions. [2023-11-24 21:59:31,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:31,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:31,903 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:31,903 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 108 flow. Second operand 5 states and 97 transitions. [2023-11-24 21:59:31,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 40 transitions, 174 flow [2023-11-24 21:59:31,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 146 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-24 21:59:31,907 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 103 flow [2023-11-24 21:59:31,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2023-11-24 21:59:31,908 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2023-11-24 21:59:31,909 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 103 flow [2023-11-24 21:59:31,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:31,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:31,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:31,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-24 21:59:32,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:32,116 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:32,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:32,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2126422213, now seen corresponding path program 1 times [2023-11-24 21:59:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:32,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072108196] [2023-11-24 21:59:32,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:32,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:32,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:32,119 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:59:32,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-24 21:59:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:32,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 21:59:32,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:59:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:32,349 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:59:32,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:59:32,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072108196] [2023-11-24 21:59:32,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072108196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:32,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:32,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:59:32,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121488402] [2023-11-24 21:59:32,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:32,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:59:32,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:59:32,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:59:32,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:59:32,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-24 21:59:32,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 103 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:32,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:32,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-24 21:59:32,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:32,642 INFO L124 PetriNetUnfolderBase]: 140/343 cut-off events. [2023-11-24 21:59:32,642 INFO L125 PetriNetUnfolderBase]: For 101/105 co-relation queries the response was YES. [2023-11-24 21:59:32,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 343 events. 140/343 cut-off events. For 101/105 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1427 event pairs, 32 based on Foata normal form. 4/337 useless extension candidates. Maximal degree in co-relation 769. Up to 139 conditions per place. [2023-11-24 21:59:32,645 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 38 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2023-11-24 21:59:32,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 256 flow [2023-11-24 21:59:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:59:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:59:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2023-11-24 21:59:32,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2023-11-24 21:59:32,648 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 148 transitions. [2023-11-24 21:59:32,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 148 transitions. [2023-11-24 21:59:32,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:32,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 148 transitions. [2023-11-24 21:59:32,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:32,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:32,651 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:32,651 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 103 flow. Second operand 6 states and 148 transitions. [2023-11-24 21:59:32,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 256 flow [2023-11-24 21:59:32,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 246 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:59:32,655 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 135 flow [2023-11-24 21:59:32,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-11-24 21:59:32,657 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2023-11-24 21:59:32,657 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 135 flow [2023-11-24 21:59:32,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:32,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:32,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:32,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-24 21:59:32,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:32,861 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:32,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:32,862 INFO L85 PathProgramCache]: Analyzing trace with hash 260632705, now seen corresponding path program 2 times [2023-11-24 21:59:32,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:32,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967693213] [2023-11-24 21:59:32,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 21:59:32,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:32,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:32,864 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:59:32,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-24 21:59:32,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-24 21:59:32,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:59:33,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-24 21:59:33,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:59:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:59:33,322 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:59:33,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:59:33,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967693213] [2023-11-24 21:59:33,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967693213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:33,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:33,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:59:33,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044085615] [2023-11-24 21:59:33,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:33,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:59:33,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:59:33,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:59:33,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:59:33,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-24 21:59:33,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 135 flow. Second operand has 8 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:33,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:33,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-24 21:59:33,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:33,721 INFO L124 PetriNetUnfolderBase]: 182/467 cut-off events. [2023-11-24 21:59:33,721 INFO L125 PetriNetUnfolderBase]: For 211/219 co-relation queries the response was YES. [2023-11-24 21:59:33,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 467 events. 182/467 cut-off events. For 211/219 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2304 event pairs, 29 based on Foata normal form. 4/455 useless extension candidates. Maximal degree in co-relation 1154. Up to 173 conditions per place. [2023-11-24 21:59:33,727 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 43 selfloop transitions, 12 changer transitions 0/72 dead transitions. [2023-11-24 21:59:33,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 363 flow [2023-11-24 21:59:33,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:59:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:59:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 226 transitions. [2023-11-24 21:59:33,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5978835978835979 [2023-11-24 21:59:33,729 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 226 transitions. [2023-11-24 21:59:33,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 226 transitions. [2023-11-24 21:59:33,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:33,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 226 transitions. [2023-11-24 21:59:33,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 25.11111111111111) internal successors, (226), 9 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:33,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 42.0) internal successors, (420), 10 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:33,734 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 42.0) internal successors, (420), 10 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:33,734 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 135 flow. Second operand 9 states and 226 transitions. [2023-11-24 21:59:33,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 363 flow [2023-11-24 21:59:33,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:59:33,741 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 228 flow [2023-11-24 21:59:33,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=228, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2023-11-24 21:59:33,743 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2023-11-24 21:59:33,744 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 228 flow [2023-11-24 21:59:33,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:33,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:33,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:33,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-24 21:59:33,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:33,948 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-24 21:59:33,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:33,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1553600363, now seen corresponding path program 3 times [2023-11-24 21:59:33,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:33,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206328213] [2023-11-24 21:59:33,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 21:59:33,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:33,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:33,951 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:59:33,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-24 21:59:34,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-24 21:59:34,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-24 21:59:34,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:59:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:59:34,282 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-24 21:59:34,282 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:59:34,283 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-24 21:59:34,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-24 21:59:34,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-24 21:59:34,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-24 21:59:34,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-24 21:59:34,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-24 21:59:34,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-24 21:59:34,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-24 21:59:34,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-24 21:59:34,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-24 21:59:34,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-24 21:59:34,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:59:34,505 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:34,511 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:59:34,511 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:59:34,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:59:34,597 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:59:34,617 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:59:34,618 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:59:34,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:59:34 BasicIcfg [2023-11-24 21:59:34,632 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:59:34,633 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:59:34,633 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:59:34,633 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:59:34,634 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:59:25" (3/4) ... [2023-11-24 21:59:34,636 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:59:34,640 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:59:34,642 INFO L158 Benchmark]: Toolchain (without parser) took 11326.93ms. Allocated memory was 81.8MB in the beginning and 161.5MB in the end (delta: 79.7MB). Free memory was 56.2MB in the beginning and 125.9MB in the end (delta: -69.6MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2023-11-24 21:59:34,642 INFO L158 Benchmark]: CDTParser took 1.43ms. Allocated memory is still 81.8MB. Free memory was 57.4MB in the beginning and 57.3MB in the end (delta: 92.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:59:34,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1098.10ms. Allocated memory is still 81.8MB. Free memory was 56.0MB in the beginning and 54.0MB in the end (delta: 2.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2023-11-24 21:59:34,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.92ms. Allocated memory is still 81.8MB. Free memory was 54.0MB in the beginning and 51.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:59:34,644 INFO L158 Benchmark]: Boogie Preprocessor took 133.06ms. Allocated memory is still 81.8MB. Free memory was 51.6MB in the beginning and 48.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:59:34,645 INFO L158 Benchmark]: RCFGBuilder took 1208.92ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 48.3MB in the beginning and 80.2MB in the end (delta: -31.9MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2023-11-24 21:59:34,653 INFO L158 Benchmark]: TraceAbstraction took 8762.62ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 79.5MB in the beginning and 126.9MB in the end (delta: -47.4MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. [2023-11-24 21:59:34,653 INFO L158 Benchmark]: Witness Printer took 7.81ms. Allocated memory is still 161.5MB. Free memory was 126.9MB in the beginning and 125.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:59:34,657 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.43ms. Allocated memory is still 81.8MB. Free memory was 57.4MB in the beginning and 57.3MB in the end (delta: 92.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1098.10ms. Allocated memory is still 81.8MB. Free memory was 56.0MB in the beginning and 54.0MB in the end (delta: 2.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.92ms. Allocated memory is still 81.8MB. Free memory was 54.0MB in the beginning and 51.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 133.06ms. Allocated memory is still 81.8MB. Free memory was 51.6MB in the beginning and 48.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1208.92ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 48.3MB in the beginning and 80.2MB in the end (delta: -31.9MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8762.62ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 79.5MB in the beginning and 126.9MB in the end (delta: -47.4MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. * Witness Printer took 7.81ms. Allocated memory is still 161.5MB. Free memory was 126.9MB in the beginning and 125.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L721] 0 _Bool y$flush_delayed; [L722] 0 int y$mem_tmp; [L723] 0 _Bool y$r_buff0_thd0; [L724] 0 _Bool y$r_buff0_thd1; [L725] 0 _Bool y$r_buff0_thd2; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$read_delayed; [L730] 0 int *y$read_delayed_var; [L731] 0 int y$w_buff0; [L732] 0 _Bool y$w_buff0_used; [L733] 0 int y$w_buff1; [L734] 0 _Bool y$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L812] 0 pthread_t t305; [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L814] 0 pthread_t t306; [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t305={3:0}, t306={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={3:0}, t306={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={3:0}, t306={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={3:0}, t306={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L830] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L17] 0 __assert_fail ("0", "mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 815]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 59 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 283 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 224 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 35 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 730 IncrementalHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 16 mSDtfsCounter, 730 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=10, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 122 ConstructedInterpolants, 1 QuantifiedInterpolants, 897 SizeOfPredicates, 9 NumberOfNonLiveVariables, 920 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-24 21:59:34,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cce2ab9-f663-4e6a-b9ca-98b20d4e1276/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample