./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:02:14,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:02:14,964 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:02:14,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:02:14,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:02:15,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:02:15,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:02:15,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:02:15,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:02:15,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:02:15,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:02:15,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:02:15,014 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:02:15,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:02:15,017 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:02:15,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:02:15,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:02:15,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:02:15,019 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:02:15,019 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:02:15,020 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:02:15,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:02:15,022 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:02:15,023 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:02:15,023 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:02:15,024 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:02:15,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:02:15,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:02:15,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:02:15,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:02:15,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:02:15,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:02:15,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:02:15,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:02:15,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:02:15,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:02:15,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:02:15,030 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:02:15,030 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_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 [2023-11-06 22:02:15,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:02:15,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:02:15,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:02:15,374 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:02:15,375 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:02:15,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i [2023-11-06 22:02:18,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:02:18,825 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:02:18,825 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i [2023-11-06 22:02:18,844 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/data/fa849e136/b4bf9b8bf2bf488cb59a81cb273848a5/FLAG2d3b7ad17 [2023-11-06 22:02:18,859 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/data/fa849e136/b4bf9b8bf2bf488cb59a81cb273848a5 [2023-11-06 22:02:18,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:02:18,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:02:18,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:02:18,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:02:18,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:02:18,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:02:18" (1/1) ... [2023-11-06 22:02:18,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e4a800d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:18, skipping insertion in model container [2023-11-06 22:02:18,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:02:18" (1/1) ... [2023-11-06 22:02:18,928 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:02:19,392 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:02:19,411 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:02:19,505 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:02:19,564 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:02:19,564 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:02:19,572 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:02:19,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:19 WrapperNode [2023-11-06 22:02:19,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:02:19,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:02:19,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:02:19,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:02:19,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:19" (1/1) ... [2023-11-06 22:02:19,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:19" (1/1) ... [2023-11-06 22:02:19,663 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-06 22:02:19,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:02:19,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:02:19,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:02:19,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:02:19,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:19" (1/1) ... [2023-11-06 22:02:19,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:19" (1/1) ... [2023-11-06 22:02:19,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:19" (1/1) ... [2023-11-06 22:02:19,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:19" (1/1) ... [2023-11-06 22:02:19,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:19" (1/1) ... [2023-11-06 22:02:19,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:19" (1/1) ... [2023-11-06 22:02:19,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:19" (1/1) ... [2023-11-06 22:02:19,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:19" (1/1) ... [2023-11-06 22:02:19,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:02:19,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:02:19,746 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:02:19,746 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:02:19,747 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:19" (1/1) ... [2023-11-06 22:02:19,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:02:19,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:19,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:02:19,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:02:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:02:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:02:19,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:02:19,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:02:19,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:02:19,824 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:02:19,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:02:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:02:19,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:02:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:02:19,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:02:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:02:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:02:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:02:19,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:02:19,829 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:02:20,030 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:02:20,032 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:02:20,469 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:02:20,705 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:02:20,705 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:02:20,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:02:20 BoogieIcfgContainer [2023-11-06 22:02:20,709 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:02:20,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:02:20,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:02:20,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:02:20,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:02:18" (1/3) ... [2023-11-06 22:02:20,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe40ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:02:20, skipping insertion in model container [2023-11-06 22:02:20,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:19" (2/3) ... [2023-11-06 22:02:20,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe40ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:02:20, skipping insertion in model container [2023-11-06 22:02:20,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:02:20" (3/3) ... [2023-11-06 22:02:20,724 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2023-11-06 22:02:20,745 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:02:20,745 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 22:02:20,746 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:02:20,808 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:02:20,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 126 transitions, 264 flow [2023-11-06 22:02:20,922 INFO L124 PetriNetUnfolderBase]: 3/123 cut-off events. [2023-11-06 22:02:20,922 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:02:20,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 3/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-11-06 22:02:20,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 126 transitions, 264 flow [2023-11-06 22:02:20,934 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 123 transitions, 255 flow [2023-11-06 22:02:20,937 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:02:20,947 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 123 transitions, 255 flow [2023-11-06 22:02:20,950 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 123 transitions, 255 flow [2023-11-06 22:02:20,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 123 transitions, 255 flow [2023-11-06 22:02:20,985 INFO L124 PetriNetUnfolderBase]: 3/123 cut-off events. [2023-11-06 22:02:20,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:02:20,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 3/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-11-06 22:02:20,989 INFO L119 LiptonReduction]: Number of co-enabled transitions 2522 [2023-11-06 22:02:27,277 INFO L134 LiptonReduction]: Checked pairs total: 6640 [2023-11-06 22:02:27,277 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-11-06 22:02:27,295 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:02:27,302 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;@87f4021, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:02:27,303 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 22:02:27,305 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:02:27,305 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:02:27,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:02:27,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:27,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:02:27,307 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:02:27,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:27,312 INFO L85 PathProgramCache]: Analyzing trace with hash 563, now seen corresponding path program 1 times [2023-11-06 22:02:27,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:27,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881124526] [2023-11-06 22:02:27,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:27,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:27,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:27,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881124526] [2023-11-06 22:02:27,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881124526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:27,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:27,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:02:27,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687711163] [2023-11-06 22:02:27,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:27,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:02:27,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:27,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:02:27,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:02:27,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 244 [2023-11-06 22:02:27,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 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-06 22:02:27,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:27,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 244 [2023-11-06 22:02:27,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:28,020 INFO L124 PetriNetUnfolderBase]: 1277/1922 cut-off events. [2023-11-06 22:02:28,020 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-06 22:02:28,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3863 conditions, 1922 events. 1277/1922 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9234 event pairs, 1277 based on Foata normal form. 0/1613 useless extension candidates. Maximal degree in co-relation 3852. Up to 1887 conditions per place. [2023-11-06 22:02:28,045 INFO L140 encePairwiseOnDemand]: 237/244 looper letters, 22 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-11-06 22:02:28,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 103 flow [2023-11-06 22:02:28,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:02:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:02:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 253 transitions. [2023-11-06 22:02:28,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5184426229508197 [2023-11-06 22:02:28,068 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 253 transitions. [2023-11-06 22:02:28,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 253 transitions. [2023-11-06 22:02:28,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:28,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 253 transitions. [2023-11-06 22:02:28,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:28,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:28,085 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:28,087 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 253 transitions. [2023-11-06 22:02:28,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 103 flow [2023-11-06 22:02:28,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:02:28,094 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-11-06 22:02:28,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-11-06 22:02:28,101 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-11-06 22:02:28,102 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-11-06 22:02:28,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 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-06 22:02:28,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:28,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:02:28,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:02:28,103 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:02:28,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash 531790200, now seen corresponding path program 1 times [2023-11-06 22:02:28,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:28,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130766496] [2023-11-06 22:02:28,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:28,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:28,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130766496] [2023-11-06 22:02:28,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130766496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:28,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:28,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:02:28,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985122913] [2023-11-06 22:02:28,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:28,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:02:28,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:28,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:02:28,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:02:28,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 244 [2023-11-06 22:02:28,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:28,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:28,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 244 [2023-11-06 22:02:28,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:28,890 INFO L124 PetriNetUnfolderBase]: 999/1561 cut-off events. [2023-11-06 22:02:28,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:02:28,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3094 conditions, 1561 events. 999/1561 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7610 event pairs, 277 based on Foata normal form. 0/1428 useless extension candidates. Maximal degree in co-relation 3091. Up to 1195 conditions per place. [2023-11-06 22:02:28,904 INFO L140 encePairwiseOnDemand]: 241/244 looper letters, 31 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-11-06 22:02:28,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 154 flow [2023-11-06 22:02:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:02:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:02:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-11-06 22:02:28,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040983606557377 [2023-11-06 22:02:28,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-11-06 22:02:28,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-11-06 22:02:28,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:28,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-11-06 22:02:28,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:28,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:28,916 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:28,916 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 369 transitions. [2023-11-06 22:02:28,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 154 flow [2023-11-06 22:02:28,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:02:28,918 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-11-06 22:02:28,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-11-06 22:02:28,919 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-11-06 22:02:28,920 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-11-06 22:02:28,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:28,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:28,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:28,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:02:28,921 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:02:28,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:28,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1559259424, now seen corresponding path program 1 times [2023-11-06 22:02:28,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:28,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524810144] [2023-11-06 22:02:28,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:28,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:29,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:29,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524810144] [2023-11-06 22:02:29,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524810144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:29,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:29,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:02:29,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563011670] [2023-11-06 22:02:29,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:29,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:02:29,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:29,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:02:29,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:02:29,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 244 [2023-11-06 22:02:29,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:29,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:29,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 244 [2023-11-06 22:02:29,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:29,927 INFO L124 PetriNetUnfolderBase]: 1235/1892 cut-off events. [2023-11-06 22:02:29,928 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-11-06 22:02:29,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3913 conditions, 1892 events. 1235/1892 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8952 event pairs, 529 based on Foata normal form. 0/1816 useless extension candidates. Maximal degree in co-relation 3909. Up to 1561 conditions per place. [2023-11-06 22:02:29,946 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 44 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2023-11-06 22:02:29,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 54 transitions, 232 flow [2023-11-06 22:02:29,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:02:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:02:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2023-11-06 22:02:29,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4786885245901639 [2023-11-06 22:02:29,950 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 584 transitions. [2023-11-06 22:02:29,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 584 transitions. [2023-11-06 22:02:29,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:29,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 584 transitions. [2023-11-06 22:02:29,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:29,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:29,958 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:29,958 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 584 transitions. [2023-11-06 22:02:29,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 54 transitions, 232 flow [2023-11-06 22:02:29,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 54 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:02:29,961 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 110 flow [2023-11-06 22:02:29,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-11-06 22:02:29,962 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-11-06 22:02:29,963 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 110 flow [2023-11-06 22:02:29,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:29,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:29,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:29,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:02:29,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:02:29,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:29,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1092403282, now seen corresponding path program 1 times [2023-11-06 22:02:29,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:29,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957662159] [2023-11-06 22:02:29,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:29,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:30,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:30,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957662159] [2023-11-06 22:02:30,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957662159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:30,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:30,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:02:30,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796838092] [2023-11-06 22:02:30,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:30,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:02:30,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:30,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:02:30,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:02:30,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 244 [2023-11-06 22:02:30,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:30,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:30,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 244 [2023-11-06 22:02:30,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:31,009 INFO L124 PetriNetUnfolderBase]: 902/1452 cut-off events. [2023-11-06 22:02:31,009 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2023-11-06 22:02:31,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3398 conditions, 1452 events. 902/1452 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7336 event pairs, 311 based on Foata normal form. 151/1582 useless extension candidates. Maximal degree in co-relation 3391. Up to 1329 conditions per place. [2023-11-06 22:02:31,023 INFO L140 encePairwiseOnDemand]: 240/244 looper letters, 27 selfloop transitions, 3 changer transitions 3/37 dead transitions. [2023-11-06 22:02:31,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 186 flow [2023-11-06 22:02:31,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:02:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:02:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-11-06 22:02:31,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41721311475409834 [2023-11-06 22:02:31,026 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-11-06 22:02:31,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-11-06 22:02:31,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:31,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-11-06 22:02:31,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:31,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:31,033 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:31,033 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 110 flow. Second operand 5 states and 509 transitions. [2023-11-06 22:02:31,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 186 flow [2023-11-06 22:02:31,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:02:31,038 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 80 flow [2023-11-06 22:02:31,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2023-11-06 22:02:31,039 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-11-06 22:02:31,039 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 80 flow [2023-11-06 22:02:31,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:31,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:31,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:31,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:02:31,040 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:02:31,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:31,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1689065677, now seen corresponding path program 1 times [2023-11-06 22:02:31,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:31,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039531280] [2023-11-06 22:02:31,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:31,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:31,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:31,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039531280] [2023-11-06 22:02:31,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039531280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:31,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:31,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:02:31,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882421762] [2023-11-06 22:02:31,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:31,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:02:31,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:31,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:02:31,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:02:31,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 244 [2023-11-06 22:02:31,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:31,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:31,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 244 [2023-11-06 22:02:31,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:32,045 INFO L124 PetriNetUnfolderBase]: 956/1533 cut-off events. [2023-11-06 22:02:32,045 INFO L125 PetriNetUnfolderBase]: For 633/633 co-relation queries the response was YES. [2023-11-06 22:02:32,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3630 conditions, 1533 events. 956/1533 cut-off events. For 633/633 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7605 event pairs, 279 based on Foata normal form. 64/1595 useless extension candidates. Maximal degree in co-relation 3623. Up to 1175 conditions per place. [2023-11-06 22:02:32,060 INFO L140 encePairwiseOnDemand]: 237/244 looper letters, 36 selfloop transitions, 6 changer transitions 16/60 dead transitions. [2023-11-06 22:02:32,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 60 transitions, 294 flow [2023-11-06 22:02:32,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:02:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:02:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions. [2023-11-06 22:02:32,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46311475409836067 [2023-11-06 22:02:32,064 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 678 transitions. [2023-11-06 22:02:32,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 678 transitions. [2023-11-06 22:02:32,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:32,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 678 transitions. [2023-11-06 22:02:32,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:32,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:32,072 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:32,072 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 80 flow. Second operand 6 states and 678 transitions. [2023-11-06 22:02:32,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 60 transitions, 294 flow [2023-11-06 22:02:32,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 60 transitions, 283 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-11-06 22:02:32,079 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 117 flow [2023-11-06 22:02:32,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-11-06 22:02:32,080 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-11-06 22:02:32,080 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 117 flow [2023-11-06 22:02:32,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:32,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:32,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:32,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:02:32,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:02:32,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:32,082 INFO L85 PathProgramCache]: Analyzing trace with hash -890729974, now seen corresponding path program 1 times [2023-11-06 22:02:32,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:32,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405253300] [2023-11-06 22:02:32,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:32,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:32,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:32,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405253300] [2023-11-06 22:02:32,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405253300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:32,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:32,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:02:32,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80726238] [2023-11-06 22:02:32,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:32,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:02:32,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:32,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:02:32,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:02:32,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 244 [2023-11-06 22:02:32,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:32,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:32,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 244 [2023-11-06 22:02:32,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:32,811 INFO L124 PetriNetUnfolderBase]: 946/1548 cut-off events. [2023-11-06 22:02:32,811 INFO L125 PetriNetUnfolderBase]: For 1751/1763 co-relation queries the response was YES. [2023-11-06 22:02:32,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4414 conditions, 1548 events. 946/1548 cut-off events. For 1751/1763 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7821 event pairs, 134 based on Foata normal form. 58/1602 useless extension candidates. Maximal degree in co-relation 4405. Up to 1088 conditions per place. [2023-11-06 22:02:32,826 INFO L140 encePairwiseOnDemand]: 236/244 looper letters, 40 selfloop transitions, 8 changer transitions 14/64 dead transitions. [2023-11-06 22:02:32,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 64 transitions, 365 flow [2023-11-06 22:02:32,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:02:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:02:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2023-11-06 22:02:32,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713114754098361 [2023-11-06 22:02:32,831 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 690 transitions. [2023-11-06 22:02:32,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 690 transitions. [2023-11-06 22:02:32,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:32,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 690 transitions. [2023-11-06 22:02:32,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:32,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:32,838 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:32,838 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 117 flow. Second operand 6 states and 690 transitions. [2023-11-06 22:02:32,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 64 transitions, 365 flow [2023-11-06 22:02:32,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 64 transitions, 349 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-06 22:02:32,852 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 152 flow [2023-11-06 22:02:32,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2023-11-06 22:02:32,855 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-11-06 22:02:32,858 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 152 flow [2023-11-06 22:02:32,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:32,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:32,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:32,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:02:32,860 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:02:32,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:32,860 INFO L85 PathProgramCache]: Analyzing trace with hash -894131914, now seen corresponding path program 2 times [2023-11-06 22:02:32,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:32,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809115964] [2023-11-06 22:02:32,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:32,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:33,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:33,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809115964] [2023-11-06 22:02:33,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809115964] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:33,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:33,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:02:33,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145946535] [2023-11-06 22:02:33,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:33,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:02:33,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:33,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:02:33,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:02:33,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 244 [2023-11-06 22:02:33,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:33,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:33,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 244 [2023-11-06 22:02:33,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:33,856 INFO L124 PetriNetUnfolderBase]: 896/1458 cut-off events. [2023-11-06 22:02:33,856 INFO L125 PetriNetUnfolderBase]: For 2483/2513 co-relation queries the response was YES. [2023-11-06 22:02:33,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4608 conditions, 1458 events. 896/1458 cut-off events. For 2483/2513 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7165 event pairs, 142 based on Foata normal form. 64/1518 useless extension candidates. Maximal degree in co-relation 4597. Up to 1064 conditions per place. [2023-11-06 22:02:33,873 INFO L140 encePairwiseOnDemand]: 236/244 looper letters, 38 selfloop transitions, 8 changer transitions 14/62 dead transitions. [2023-11-06 22:02:33,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 384 flow [2023-11-06 22:02:33,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:02:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:02:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 682 transitions. [2023-11-06 22:02:33,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46584699453551914 [2023-11-06 22:02:33,877 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 682 transitions. [2023-11-06 22:02:33,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 682 transitions. [2023-11-06 22:02:33,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:33,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 682 transitions. [2023-11-06 22:02:33,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:33,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:33,885 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:33,885 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 152 flow. Second operand 6 states and 682 transitions. [2023-11-06 22:02:33,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 384 flow [2023-11-06 22:02:33,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 363 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-06 22:02:33,897 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 163 flow [2023-11-06 22:02:33,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2023-11-06 22:02:33,898 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-11-06 22:02:33,898 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 163 flow [2023-11-06 22:02:33,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:33,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:33,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:33,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:02:33,899 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:02:33,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:33,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1842862165, now seen corresponding path program 1 times [2023-11-06 22:02:33,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:33,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161488590] [2023-11-06 22:02:33,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:33,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:34,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:34,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161488590] [2023-11-06 22:02:34,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161488590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:34,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:34,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:02:34,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455301494] [2023-11-06 22:02:34,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:34,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:02:34,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:34,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:02:34,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:02:34,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 244 [2023-11-06 22:02:34,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:34,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:34,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 244 [2023-11-06 22:02:34,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:34,827 INFO L124 PetriNetUnfolderBase]: 904/1456 cut-off events. [2023-11-06 22:02:34,828 INFO L125 PetriNetUnfolderBase]: For 2742/2774 co-relation queries the response was YES. [2023-11-06 22:02:34,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4712 conditions, 1456 events. 904/1456 cut-off events. For 2742/2774 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7102 event pairs, 170 based on Foata normal form. 52/1504 useless extension candidates. Maximal degree in co-relation 4700. Up to 1085 conditions per place. [2023-11-06 22:02:34,845 INFO L140 encePairwiseOnDemand]: 235/244 looper letters, 43 selfloop transitions, 12 changer transitions 8/65 dead transitions. [2023-11-06 22:02:34,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 65 transitions, 412 flow [2023-11-06 22:02:34,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:02:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:02:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions. [2023-11-06 22:02:34,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46311475409836067 [2023-11-06 22:02:34,849 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 678 transitions. [2023-11-06 22:02:34,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 678 transitions. [2023-11-06 22:02:34,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:34,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 678 transitions. [2023-11-06 22:02:34,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:34,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:34,856 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:34,856 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 163 flow. Second operand 6 states and 678 transitions. [2023-11-06 22:02:34,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 65 transitions, 412 flow [2023-11-06 22:02:34,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 388 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-06 22:02:34,869 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 202 flow [2023-11-06 22:02:34,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-11-06 22:02:34,870 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-11-06 22:02:34,870 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 202 flow [2023-11-06 22:02:34,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:34,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:34,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:34,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:02:34,871 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:02:34,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:34,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1949879125, now seen corresponding path program 2 times [2023-11-06 22:02:34,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:34,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234778403] [2023-11-06 22:02:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:34,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:35,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:35,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234778403] [2023-11-06 22:02:35,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234778403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:35,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:35,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:02:35,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900725600] [2023-11-06 22:02:35,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:35,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:02:35,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:35,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:02:35,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:02:35,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 244 [2023-11-06 22:02:35,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 202 flow. Second operand has 7 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:35,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:35,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 244 [2023-11-06 22:02:35,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:36,088 INFO L124 PetriNetUnfolderBase]: 1009/1598 cut-off events. [2023-11-06 22:02:36,089 INFO L125 PetriNetUnfolderBase]: For 2905/2938 co-relation queries the response was YES. [2023-11-06 22:02:36,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5581 conditions, 1598 events. 1009/1598 cut-off events. For 2905/2938 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7533 event pairs, 275 based on Foata normal form. 54/1650 useless extension candidates. Maximal degree in co-relation 5570. Up to 1162 conditions per place. [2023-11-06 22:02:36,106 INFO L140 encePairwiseOnDemand]: 235/244 looper letters, 55 selfloop transitions, 30 changer transitions 13/100 dead transitions. [2023-11-06 22:02:36,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 100 transitions, 722 flow [2023-11-06 22:02:36,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:02:36,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:02:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1107 transitions. [2023-11-06 22:02:36,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45368852459016396 [2023-11-06 22:02:36,112 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1107 transitions. [2023-11-06 22:02:36,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1107 transitions. [2023-11-06 22:02:36,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:36,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1107 transitions. [2023-11-06 22:02:36,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 110.7) internal successors, (1107), 10 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:36,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 244.0) internal successors, (2684), 11 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:36,123 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 244.0) internal successors, (2684), 11 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:36,124 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 202 flow. Second operand 10 states and 1107 transitions. [2023-11-06 22:02:36,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 100 transitions, 722 flow [2023-11-06 22:02:36,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 100 transitions, 674 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-11-06 22:02:36,131 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 427 flow [2023-11-06 22:02:36,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=427, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2023-11-06 22:02:36,132 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-11-06 22:02:36,132 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 427 flow [2023-11-06 22:02:36,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:36,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:36,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:36,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:02:36,134 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:02:36,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:36,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1864405066, now seen corresponding path program 1 times [2023-11-06 22:02:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181940809] [2023-11-06 22:02:36,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:36,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:36,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:36,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181940809] [2023-11-06 22:02:36,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181940809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:36,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:36,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:02:36,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711082150] [2023-11-06 22:02:36,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:36,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:02:36,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:36,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:02:36,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:02:36,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 244 [2023-11-06 22:02:36,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:36,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:36,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 244 [2023-11-06 22:02:36,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:36,634 INFO L124 PetriNetUnfolderBase]: 664/1115 cut-off events. [2023-11-06 22:02:36,634 INFO L125 PetriNetUnfolderBase]: For 4126/4219 co-relation queries the response was YES. [2023-11-06 22:02:36,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4522 conditions, 1115 events. 664/1115 cut-off events. For 4126/4219 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5592 event pairs, 112 based on Foata normal form. 151/1257 useless extension candidates. Maximal degree in co-relation 4505. Up to 485 conditions per place. [2023-11-06 22:02:36,647 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 81 selfloop transitions, 5 changer transitions 0/93 dead transitions. [2023-11-06 22:02:36,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 854 flow [2023-11-06 22:02:36,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:02:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:02:36,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2023-11-06 22:02:36,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47950819672131145 [2023-11-06 22:02:36,651 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2023-11-06 22:02:36,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2023-11-06 22:02:36,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:36,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2023-11-06 22:02:36,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:36,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:36,656 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:36,657 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 427 flow. Second operand 4 states and 468 transitions. [2023-11-06 22:02:36,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 854 flow [2023-11-06 22:02:36,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 93 transitions, 773 flow, removed 38 selfloop flow, removed 4 redundant places. [2023-11-06 22:02:36,666 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 386 flow [2023-11-06 22:02:36,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=386, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2023-11-06 22:02:36,667 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-11-06 22:02:36,668 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 386 flow [2023-11-06 22:02:36,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:36,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:36,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:36,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:02:36,669 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:02:36,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2141499375, now seen corresponding path program 1 times [2023-11-06 22:02:36,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:36,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739030705] [2023-11-06 22:02:36,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:36,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:36,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:36,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739030705] [2023-11-06 22:02:36,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739030705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:36,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:36,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:02:36,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374502283] [2023-11-06 22:02:36,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:36,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:02:36,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:36,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:02:36,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:02:36,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 244 [2023-11-06 22:02:36,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 386 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:36,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:36,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 244 [2023-11-06 22:02:36,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:37,143 INFO L124 PetriNetUnfolderBase]: 460/822 cut-off events. [2023-11-06 22:02:37,143 INFO L125 PetriNetUnfolderBase]: For 2770/2834 co-relation queries the response was YES. [2023-11-06 22:02:37,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3350 conditions, 822 events. 460/822 cut-off events. For 2770/2834 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4007 event pairs, 119 based on Foata normal form. 94/907 useless extension candidates. Maximal degree in co-relation 3334. Up to 312 conditions per place. [2023-11-06 22:02:37,151 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 79 selfloop transitions, 8 changer transitions 0/94 dead transitions. [2023-11-06 22:02:37,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 794 flow [2023-11-06 22:02:37,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:02:37,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:02:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2023-11-06 22:02:37,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48032786885245904 [2023-11-06 22:02:37,154 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 586 transitions. [2023-11-06 22:02:37,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 586 transitions. [2023-11-06 22:02:37,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:37,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 586 transitions. [2023-11-06 22:02:37,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:37,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:37,161 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:37,161 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 386 flow. Second operand 5 states and 586 transitions. [2023-11-06 22:02:37,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 794 flow [2023-11-06 22:02:37,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 94 transitions, 777 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:02:37,169 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 410 flow [2023-11-06 22:02:37,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=410, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2023-11-06 22:02:37,170 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-11-06 22:02:37,170 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 410 flow [2023-11-06 22:02:37,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:37,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:37,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:37,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:02:37,171 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:02:37,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:37,172 INFO L85 PathProgramCache]: Analyzing trace with hash -822218661, now seen corresponding path program 1 times [2023-11-06 22:02:37,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:37,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300682693] [2023-11-06 22:02:37,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:37,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:37,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:37,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300682693] [2023-11-06 22:02:37,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300682693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:37,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:37,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:02:37,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876286776] [2023-11-06 22:02:37,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:37,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:02:37,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:37,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:02:37,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:02:37,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 244 [2023-11-06 22:02:37,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 410 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:37,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:37,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 244 [2023-11-06 22:02:37,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:37,710 INFO L124 PetriNetUnfolderBase]: 428/760 cut-off events. [2023-11-06 22:02:37,710 INFO L125 PetriNetUnfolderBase]: For 3049/3110 co-relation queries the response was YES. [2023-11-06 22:02:37,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3234 conditions, 760 events. 428/760 cut-off events. For 3049/3110 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3722 event pairs, 118 based on Foata normal form. 49/800 useless extension candidates. Maximal degree in co-relation 3217. Up to 312 conditions per place. [2023-11-06 22:02:37,717 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 64 selfloop transitions, 11 changer transitions 1/83 dead transitions. [2023-11-06 22:02:37,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 83 transitions, 723 flow [2023-11-06 22:02:37,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:02:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:02:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 684 transitions. [2023-11-06 22:02:37,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672131147540984 [2023-11-06 22:02:37,722 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 684 transitions. [2023-11-06 22:02:37,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 684 transitions. [2023-11-06 22:02:37,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:37,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 684 transitions. [2023-11-06 22:02:37,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:37,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:37,729 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:37,729 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 410 flow. Second operand 6 states and 684 transitions. [2023-11-06 22:02:37,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 83 transitions, 723 flow [2023-11-06 22:02:37,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 83 transitions, 675 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-11-06 22:02:37,738 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 385 flow [2023-11-06 22:02:37,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-06 22:02:37,739 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2023-11-06 22:02:37,739 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 385 flow [2023-11-06 22:02:37,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:37,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:37,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:37,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:02:37,740 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:02:37,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:37,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1274406482, now seen corresponding path program 1 times [2023-11-06 22:02:37,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:37,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92825577] [2023-11-06 22:02:37,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:37,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:38,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:38,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92825577] [2023-11-06 22:02:38,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92825577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:38,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:38,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:02:38,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326747409] [2023-11-06 22:02:38,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:38,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:02:38,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:38,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:02:38,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:02:38,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 244 [2023-11-06 22:02:38,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 385 flow. Second operand has 8 states, 8 states have (on average 96.75) internal successors, (774), 8 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:38,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:38,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 244 [2023-11-06 22:02:38,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:39,242 INFO L124 PetriNetUnfolderBase]: 1047/1714 cut-off events. [2023-11-06 22:02:39,242 INFO L125 PetriNetUnfolderBase]: For 6566/6566 co-relation queries the response was YES. [2023-11-06 22:02:39,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7338 conditions, 1714 events. 1047/1714 cut-off events. For 6566/6566 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8489 event pairs, 50 based on Foata normal form. 1/1715 useless extension candidates. Maximal degree in co-relation 7320. Up to 716 conditions per place. [2023-11-06 22:02:39,255 INFO L140 encePairwiseOnDemand]: 235/244 looper letters, 61 selfloop transitions, 6 changer transitions 84/151 dead transitions. [2023-11-06 22:02:39,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 151 transitions, 1354 flow [2023-11-06 22:02:39,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:02:39,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 22:02:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1116 transitions. [2023-11-06 22:02:39,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4157973174366617 [2023-11-06 22:02:39,262 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1116 transitions. [2023-11-06 22:02:39,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1116 transitions. [2023-11-06 22:02:39,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:39,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1116 transitions. [2023-11-06 22:02:39,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 101.45454545454545) internal successors, (1116), 11 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:39,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 244.0) internal successors, (2928), 12 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:39,273 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 244.0) internal successors, (2928), 12 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:39,274 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 385 flow. Second operand 11 states and 1116 transitions. [2023-11-06 22:02:39,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 151 transitions, 1354 flow [2023-11-06 22:02:39,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 151 transitions, 1220 flow, removed 25 selfloop flow, removed 7 redundant places. [2023-11-06 22:02:39,299 INFO L231 Difference]: Finished difference. Result has 74 places, 44 transitions, 291 flow [2023-11-06 22:02:39,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=291, PETRI_PLACES=74, PETRI_TRANSITIONS=44} [2023-11-06 22:02:39,301 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2023-11-06 22:02:39,301 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 44 transitions, 291 flow [2023-11-06 22:02:39,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.75) internal successors, (774), 8 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:39,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:39,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:39,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:02:39,302 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:02:39,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:39,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1802737008, now seen corresponding path program 2 times [2023-11-06 22:02:39,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:39,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211427847] [2023-11-06 22:02:39,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:39,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:02:39,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211427847] [2023-11-06 22:02:39,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211427847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:39,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:39,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:02:39,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46724774] [2023-11-06 22:02:39,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:39,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:02:39,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:39,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:02:39,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:02:39,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 244 [2023-11-06 22:02:39,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 44 transitions, 291 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:39,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:39,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 244 [2023-11-06 22:02:39,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:40,183 INFO L124 PetriNetUnfolderBase]: 263/504 cut-off events. [2023-11-06 22:02:40,183 INFO L125 PetriNetUnfolderBase]: For 1488/1501 co-relation queries the response was YES. [2023-11-06 22:02:40,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 504 events. 263/504 cut-off events. For 1488/1501 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2164 event pairs, 36 based on Foata normal form. 11/514 useless extension candidates. Maximal degree in co-relation 2191. Up to 300 conditions per place. [2023-11-06 22:02:40,190 INFO L140 encePairwiseOnDemand]: 237/244 looper letters, 42 selfloop transitions, 3 changer transitions 45/92 dead transitions. [2023-11-06 22:02:40,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 92 transitions, 765 flow [2023-11-06 22:02:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:02:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:02:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 731 transitions. [2023-11-06 22:02:40,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42798594847775173 [2023-11-06 22:02:40,195 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 731 transitions. [2023-11-06 22:02:40,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 731 transitions. [2023-11-06 22:02:40,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:40,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 731 transitions. [2023-11-06 22:02:40,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.42857142857143) internal successors, (731), 7 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:40,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:40,203 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:40,203 INFO L175 Difference]: Start difference. First operand has 74 places, 44 transitions, 291 flow. Second operand 7 states and 731 transitions. [2023-11-06 22:02:40,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 92 transitions, 765 flow [2023-11-06 22:02:40,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 92 transitions, 583 flow, removed 36 selfloop flow, removed 19 redundant places. [2023-11-06 22:02:40,210 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 170 flow [2023-11-06 22:02:40,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=170, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2023-11-06 22:02:40,211 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-11-06 22:02:40,211 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 170 flow [2023-11-06 22:02:40,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:40,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:40,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:40,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:02:40,213 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:02:40,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash 308384114, now seen corresponding path program 3 times [2023-11-06 22:02:40,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:40,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81755600] [2023-11-06 22:02:40,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:40,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:02:40,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:02:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:02:40,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:02:40,382 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:02:40,383 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 22:02:40,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 22:02:40,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 22:02:40,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 22:02:40,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 22:02:40,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 22:02:40,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 22:02:40,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 22:02:40,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 22:02:40,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 22:02:40,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 22:02:40,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 22:02:40,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 22:02:40,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:02:40,388 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:40,395 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:02:40,395 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:02:40,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:02:40 BasicIcfg [2023-11-06 22:02:40,482 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:02:40,482 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:02:40,483 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:02:40,483 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:02:40,483 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:02:20" (3/4) ... [2023-11-06 22:02:40,485 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:02:40,486 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:02:40,487 INFO L158 Benchmark]: Toolchain (without parser) took 21621.52ms. Allocated memory was 146.8MB in the beginning and 381.7MB in the end (delta: 234.9MB). Free memory was 114.7MB in the beginning and 153.9MB in the end (delta: -39.3MB). Peak memory consumption was 196.6MB. Max. memory is 16.1GB. [2023-11-06 22:02:40,487 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 146.8MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:02:40,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 706.43ms. Allocated memory is still 146.8MB. Free memory was 114.4MB in the beginning and 90.9MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:02:40,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.65ms. Allocated memory is still 146.8MB. Free memory was 90.9MB in the beginning and 88.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:02:40,489 INFO L158 Benchmark]: Boogie Preprocessor took 79.67ms. Allocated memory is still 146.8MB. Free memory was 88.1MB in the beginning and 86.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:02:40,489 INFO L158 Benchmark]: RCFGBuilder took 963.05ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 86.0MB in the beginning and 121.7MB in the end (delta: -35.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2023-11-06 22:02:40,489 INFO L158 Benchmark]: TraceAbstraction took 19768.60ms. Allocated memory was 176.2MB in the beginning and 381.7MB in the end (delta: 205.5MB). Free memory was 120.8MB in the beginning and 153.9MB in the end (delta: -33.1MB). Peak memory consumption was 171.2MB. Max. memory is 16.1GB. [2023-11-06 22:02:40,490 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 381.7MB. Free memory is still 153.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:02:40,492 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 146.8MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 706.43ms. Allocated memory is still 146.8MB. Free memory was 114.4MB in the beginning and 90.9MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.65ms. Allocated memory is still 146.8MB. Free memory was 90.9MB in the beginning and 88.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.67ms. Allocated memory is still 146.8MB. Free memory was 88.1MB in the beginning and 86.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 963.05ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 86.0MB in the beginning and 121.7MB in the end (delta: -35.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19768.60ms. Allocated memory was 176.2MB in the beginning and 381.7MB in the end (delta: 205.5MB). Free memory was 120.8MB in the beginning and 153.9MB in the end (delta: -33.1MB). Peak memory consumption was 171.2MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 381.7MB. Free memory is still 153.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 130 PlacesBefore, 41 PlacesAfterwards, 123 TransitionsBefore, 32 TransitionsAfterwards, 2522 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 118 TotalNumberOfCompositions, 6640 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2726, independent: 2545, independent conditional: 0, independent unconditional: 2545, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1292, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2726, independent: 1280, independent conditional: 0, independent unconditional: 1280, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 1292, unknown conditional: 0, unknown unconditional: 1292] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1403; [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1403, ((void *)0), P0, ((void *)0))=-2, t1403={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L822] 0 pthread_t t1404; [L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1404, ((void *)0), P1, ((void *)0))=-1, t1403={5:0}, t1404={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L824] 0 pthread_t t1405; [L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1405, ((void *)0), P2, ((void *)0))=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix052_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 821]: 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: 825]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 826 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 671 mSDsluCounter, 454 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 386 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1905 IncrementalHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 68 mSDtfsCounter, 1905 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=427occurred in iteration=9, InterpolantAutomatonStates: 82, 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.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 1285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:02:40,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:02:43,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:02:43,386 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:02:43,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:02:43,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:02:43,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:02:43,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:02:43,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:02:43,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:02:43,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:02:43,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:02:43,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:02:43,475 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:02:43,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:02:43,477 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:02:43,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:02:43,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:02:43,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:02:43,479 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:02:43,480 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:02:43,480 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:02:43,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:02:43,481 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:02:43,481 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:02:43,482 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:02:43,482 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:02:43,483 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:02:43,483 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:02:43,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:02:43,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:02:43,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:02:43,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:02:43,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:02:43,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:02:43,487 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:02:43,488 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:02:43,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:02:43,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:02:43,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:02:43,490 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:02:43,490 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:02:43,490 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_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 [2023-11-06 22:02:43,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:02:43,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:02:43,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:02:43,948 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:02:43,949 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:02:43,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i [2023-11-06 22:02:47,072 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:02:47,386 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:02:47,387 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/sv-benchmarks/c/pthread-wmm/mix052_tso.oepc.i [2023-11-06 22:02:47,418 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/data/71ac9eb26/e22e7afc2a89417e86babcf1efed7979/FLAG320b6bbca [2023-11-06 22:02:47,435 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/data/71ac9eb26/e22e7afc2a89417e86babcf1efed7979 [2023-11-06 22:02:47,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:02:47,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:02:47,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:02:47,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:02:47,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:02:47,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:02:47" (1/1) ... [2023-11-06 22:02:47,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4379876b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:47, skipping insertion in model container [2023-11-06 22:02:47,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:02:47" (1/1) ... [2023-11-06 22:02:47,546 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:02:48,036 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:02:48,060 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:02:48,166 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:02:48,235 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:02:48,235 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:02:48,243 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:02:48,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:48 WrapperNode [2023-11-06 22:02:48,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:02:48,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:02:48,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:02:48,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:02:48,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:48" (1/1) ... [2023-11-06 22:02:48,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:48" (1/1) ... [2023-11-06 22:02:48,363 INFO L138 Inliner]: procedures = 179, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-06 22:02:48,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:02:48,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:02:48,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:02:48,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:02:48,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:48" (1/1) ... [2023-11-06 22:02:48,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:48" (1/1) ... [2023-11-06 22:02:48,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:48" (1/1) ... [2023-11-06 22:02:48,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:48" (1/1) ... [2023-11-06 22:02:48,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:48" (1/1) ... [2023-11-06 22:02:48,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:48" (1/1) ... [2023-11-06 22:02:48,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:48" (1/1) ... [2023-11-06 22:02:48,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:48" (1/1) ... [2023-11-06 22:02:48,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:02:48,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:02:48,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:02:48,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:02:48,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:48" (1/1) ... [2023-11-06 22:02:48,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:02:48,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:48,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:02:48,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:02:48,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:02:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:02:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:02:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:02:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:02:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:02:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:02:48,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:02:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:02:48,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:02:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:02:48,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:02:48,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:02:48,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:02:48,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:02:48,557 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:02:48,787 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:02:48,790 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:02:49,334 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:02:49,535 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:02:49,535 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:02:49,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:02:49 BoogieIcfgContainer [2023-11-06 22:02:49,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:02:49,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:02:49,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:02:49,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:02:49,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:02:47" (1/3) ... [2023-11-06 22:02:49,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1809cad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:02:49, skipping insertion in model container [2023-11-06 22:02:49,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:48" (2/3) ... [2023-11-06 22:02:49,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1809cad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:02:49, skipping insertion in model container [2023-11-06 22:02:49,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:02:49" (3/3) ... [2023-11-06 22:02:49,554 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2023-11-06 22:02:49,576 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:02:49,576 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 22:02:49,577 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:02:49,676 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:02:49,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 127 transitions, 266 flow [2023-11-06 22:02:49,795 INFO L124 PetriNetUnfolderBase]: 3/124 cut-off events. [2023-11-06 22:02:49,795 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:02:49,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 3/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-11-06 22:02:49,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 127 transitions, 266 flow [2023-11-06 22:02:49,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 124 transitions, 257 flow [2023-11-06 22:02:49,812 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:02:49,823 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 124 transitions, 257 flow [2023-11-06 22:02:49,826 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 124 transitions, 257 flow [2023-11-06 22:02:49,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 124 transitions, 257 flow [2023-11-06 22:02:49,859 INFO L124 PetriNetUnfolderBase]: 3/124 cut-off events. [2023-11-06 22:02:49,859 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:02:49,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 3/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-11-06 22:02:49,863 INFO L119 LiptonReduction]: Number of co-enabled transitions 2522 [2023-11-06 22:03:00,964 INFO L134 LiptonReduction]: Checked pairs total: 6594 [2023-11-06 22:03:00,965 INFO L136 LiptonReduction]: Total number of compositions: 127 [2023-11-06 22:03:00,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:03:00,988 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;@17e9f7b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:03:00,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 22:03:00,991 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:03:00,992 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:03:00,992 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:03:00,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:03:00,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:03:00,993 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:03:00,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:00,999 INFO L85 PathProgramCache]: Analyzing trace with hash 573, now seen corresponding path program 1 times [2023-11-06 22:03:01,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:01,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158444530] [2023-11-06 22:03:01,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:01,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:01,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:01,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:03:01,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:03:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:01,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:03:01,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:03:01,134 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:03:01,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:03:01,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158444530] [2023-11-06 22:03:01,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158444530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:01,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:01,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:03:01,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906474482] [2023-11-06 22:03:01,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:01,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:03:01,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:03:01,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:03:01,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:03:01,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 254 [2023-11-06 22:03:01,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:01,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:03:01,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 254 [2023-11-06 22:03:01,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:03:01,842 INFO L124 PetriNetUnfolderBase]: 1093/1642 cut-off events. [2023-11-06 22:03:01,843 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-06 22:03:01,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3319 conditions, 1642 events. 1093/1642 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7718 event pairs, 1093 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 3308. Up to 1623 conditions per place. [2023-11-06 22:03:01,860 INFO L140 encePairwiseOnDemand]: 248/254 looper letters, 21 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-11-06 22:03:01,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 99 flow [2023-11-06 22:03:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:03:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:03:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 253 transitions. [2023-11-06 22:03:01,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49803149606299213 [2023-11-06 22:03:01,877 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 253 transitions. [2023-11-06 22:03:01,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 253 transitions. [2023-11-06 22:03:01,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:03:01,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 253 transitions. [2023-11-06 22:03:01,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:01,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:01,892 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:01,894 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 69 flow. Second operand 2 states and 253 transitions. [2023-11-06 22:03:01,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 99 flow [2023-11-06 22:03:01,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:03:01,900 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-11-06 22:03:01,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-11-06 22:03:01,906 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-11-06 22:03:01,907 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-11-06 22:03:01,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:01,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:03:01,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:03:01,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:02,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:02,124 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:03:02,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:02,125 INFO L85 PathProgramCache]: Analyzing trace with hash 541104276, now seen corresponding path program 1 times [2023-11-06 22:03:02,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:02,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792627140] [2023-11-06 22:03:02,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:02,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:02,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:02,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:03:02,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:03:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:02,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:03:02,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:03:02,291 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:03:02,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:03:02,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792627140] [2023-11-06 22:03:02,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792627140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:02,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:02,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:03:02,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854851689] [2023-11-06 22:03:02,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:02,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:03:02,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:03:02,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:03:02,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:03:02,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 254 [2023-11-06 22:03:02,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:02,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:03:02,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 254 [2023-11-06 22:03:02,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:03:02,671 INFO L124 PetriNetUnfolderBase]: 855/1341 cut-off events. [2023-11-06 22:03:02,674 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:03:02,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 1341 events. 855/1341 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6459 event pairs, 237 based on Foata normal form. 0/1208 useless extension candidates. Maximal degree in co-relation 2663. Up to 1027 conditions per place. [2023-11-06 22:03:02,686 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-11-06 22:03:02,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 146 flow [2023-11-06 22:03:02,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:03:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:03:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-11-06 22:03:02,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48556430446194226 [2023-11-06 22:03:02,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-11-06 22:03:02,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-11-06 22:03:02,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:03:02,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-11-06 22:03:02,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:02,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:02,716 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:02,716 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 370 transitions. [2023-11-06 22:03:02,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 146 flow [2023-11-06 22:03:02,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:03:02,718 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-11-06 22:03:02,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-11-06 22:03:02,719 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-11-06 22:03:02,719 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-11-06 22:03:02,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:02,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:03:02,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:02,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:02,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:02,932 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:03:02,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:02,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1776233672, now seen corresponding path program 1 times [2023-11-06 22:03:02,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:02,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508155303] [2023-11-06 22:03:02,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:02,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:02,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:02,960 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:03:02,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:03:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:03,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:03:03,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:03:03,135 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:03:03,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:03:03,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508155303] [2023-11-06 22:03:03,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508155303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:03,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:03,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:03:03,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93907471] [2023-11-06 22:03:03,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:03,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:03:03,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:03:03,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:03:03,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:03:03,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 254 [2023-11-06 22:03:03,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:03,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:03:03,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 254 [2023-11-06 22:03:03,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:03:03,442 INFO L124 PetriNetUnfolderBase]: 494/827 cut-off events. [2023-11-06 22:03:03,442 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-06 22:03:03,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 827 events. 494/827 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3979 event pairs, 112 based on Foata normal form. 64/841 useless extension candidates. Maximal degree in co-relation 1749. Up to 401 conditions per place. [2023-11-06 22:03:03,448 INFO L140 encePairwiseOnDemand]: 248/254 looper letters, 36 selfloop transitions, 5 changer transitions 1/45 dead transitions. [2023-11-06 22:03:03,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 192 flow [2023-11-06 22:03:03,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:03:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:03:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2023-11-06 22:03:03,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645669291338583 [2023-11-06 22:03:03,452 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2023-11-06 22:03:03,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2023-11-06 22:03:03,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:03:03,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2023-11-06 22:03:03,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:03,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:03,459 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:03,460 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 4 states and 472 transitions. [2023-11-06 22:03:03,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 192 flow [2023-11-06 22:03:03,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:03:03,462 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 84 flow [2023-11-06 22:03:03,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-11-06 22:03:03,464 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2023-11-06 22:03:03,464 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 84 flow [2023-11-06 22:03:03,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:03,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:03:03,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:03,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:03,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:03,677 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:03:03,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:03,678 INFO L85 PathProgramCache]: Analyzing trace with hash -546959570, now seen corresponding path program 1 times [2023-11-06 22:03:03,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:03,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001602374] [2023-11-06 22:03:03,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:03,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:03,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:03,680 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:03:03,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:03:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:03,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:03:03,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:03,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:03:03,862 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:03:03,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:03:03,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001602374] [2023-11-06 22:03:03,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001602374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:03,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:03,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:03:03,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191728398] [2023-11-06 22:03:03,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:03,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:03:03,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:03:03,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:03:03,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:03:03,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 254 [2023-11-06 22:03:03,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:03,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:03:03,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 254 [2023-11-06 22:03:03,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:03:04,169 INFO L124 PetriNetUnfolderBase]: 224/419 cut-off events. [2023-11-06 22:03:04,169 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-06 22:03:04,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 419 events. 224/419 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1822 event pairs, 56 based on Foata normal form. 37/441 useless extension candidates. Maximal degree in co-relation 1102. Up to 162 conditions per place. [2023-11-06 22:03:04,173 INFO L140 encePairwiseOnDemand]: 248/254 looper letters, 44 selfloop transitions, 8 changer transitions 1/56 dead transitions. [2023-11-06 22:03:04,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 56 transitions, 273 flow [2023-11-06 22:03:04,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:03:04,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:03:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2023-11-06 22:03:04,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645669291338583 [2023-11-06 22:03:04,178 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2023-11-06 22:03:04,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2023-11-06 22:03:04,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:03:04,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2023-11-06 22:03:04,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:04,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:04,187 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:04,187 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 84 flow. Second operand 5 states and 590 transitions. [2023-11-06 22:03:04,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 56 transitions, 273 flow [2023-11-06 22:03:04,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 56 transitions, 263 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:03:04,191 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 124 flow [2023-11-06 22:03:04,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-11-06 22:03:04,192 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-11-06 22:03:04,192 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 124 flow [2023-11-06 22:03:04,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:04,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:03:04,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:04,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:04,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:04,406 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:03:04,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:04,407 INFO L85 PathProgramCache]: Analyzing trace with hash -847578617, now seen corresponding path program 1 times [2023-11-06 22:03:04,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:04,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919996713] [2023-11-06 22:03:04,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:04,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:04,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:04,409 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:03:04,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:03:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:04,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:03:04,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:03:04,615 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:03:04,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:03:04,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919996713] [2023-11-06 22:03:04,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919996713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:04,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:04,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:03:04,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923961072] [2023-11-06 22:03:04,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:04,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:03:04,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:03:04,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:03:04,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:03:04,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 254 [2023-11-06 22:03:04,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 124 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:04,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:03:04,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 254 [2023-11-06 22:03:04,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:03:04,940 INFO L124 PetriNetUnfolderBase]: 143/275 cut-off events. [2023-11-06 22:03:04,941 INFO L125 PetriNetUnfolderBase]: For 261/261 co-relation queries the response was YES. [2023-11-06 22:03:04,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 275 events. 143/275 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1068 event pairs, 56 based on Foata normal form. 10/279 useless extension candidates. Maximal degree in co-relation 805. Up to 108 conditions per place. [2023-11-06 22:03:04,943 INFO L140 encePairwiseOnDemand]: 248/254 looper letters, 32 selfloop transitions, 11 changer transitions 1/47 dead transitions. [2023-11-06 22:03:04,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 260 flow [2023-11-06 22:03:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:03:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:03:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 688 transitions. [2023-11-06 22:03:04,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45144356955380577 [2023-11-06 22:03:04,948 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 688 transitions. [2023-11-06 22:03:04,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 688 transitions. [2023-11-06 22:03:04,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:03:04,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 688 transitions. [2023-11-06 22:03:04,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:04,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:04,958 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:04,958 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 124 flow. Second operand 6 states and 688 transitions. [2023-11-06 22:03:04,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 260 flow [2023-11-06 22:03:04,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 235 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-06 22:03:04,963 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 138 flow [2023-11-06 22:03:04,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-11-06 22:03:04,964 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-11-06 22:03:04,964 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 138 flow [2023-11-06 22:03:04,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:04,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:03:04,965 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-06 22:03:04,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:05,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:05,178 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:03:05,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:05,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1270438602, now seen corresponding path program 1 times [2023-11-06 22:03:05,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:05,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432045318] [2023-11-06 22:03:05,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:05,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-06 22:03:05,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:05,181 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:03:05,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:03:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:05,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:03:05,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:03:05,383 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:03:05,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:03:05,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432045318] [2023-11-06 22:03:05,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432045318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:05,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:05,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:03:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124832273] [2023-11-06 22:03:05,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:05,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:03:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:03:05,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:03:05,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:03:05,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 254 [2023-11-06 22:03:05,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:05,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:03:05,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 254 [2023-11-06 22:03:05,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:03:05,612 INFO L124 PetriNetUnfolderBase]: 198/392 cut-off events. [2023-11-06 22:03:05,612 INFO L125 PetriNetUnfolderBase]: For 425/425 co-relation queries the response was YES. [2023-11-06 22:03:05,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 392 events. 198/392 cut-off events. For 425/425 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1814 event pairs, 18 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 1137. Up to 223 conditions per place. [2023-11-06 22:03:05,617 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 53 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-06 22:03:05,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 406 flow [2023-11-06 22:03:05,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:03:05,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:03:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-11-06 22:03:05,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4704724409448819 [2023-11-06 22:03:05,621 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-11-06 22:03:05,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-11-06 22:03:05,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:03:05,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-11-06 22:03:05,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:05,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:05,627 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:05,627 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 138 flow. Second operand 4 states and 478 transitions. [2023-11-06 22:03:05,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 406 flow [2023-11-06 22:03:05,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 57 transitions, 277 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-11-06 22:03:05,633 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 93 flow [2023-11-06 22:03:05,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-11-06 22:03:05,634 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-11-06 22:03:05,634 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 93 flow [2023-11-06 22:03:05,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:05,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:03:05,635 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-06 22:03:05,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:05,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:05,852 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:03:05,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:05,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1582534986, now seen corresponding path program 2 times [2023-11-06 22:03:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:05,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972696829] [2023-11-06 22:03:05,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:03:05,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:05,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:05,855 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:03:05,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 22:03:05,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:03:05,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:03:06,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 22:03:06,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:03:06,631 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:03:06,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:03:06,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972696829] [2023-11-06 22:03:06,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972696829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:06,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:06,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:03:06,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164457594] [2023-11-06 22:03:06,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:06,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:03:06,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:03:06,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:03:06,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:03:06,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 254 [2023-11-06 22:03:06,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 93 flow. Second operand has 9 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:06,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:03:06,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 254 [2023-11-06 22:03:06,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:03:07,197 INFO L124 PetriNetUnfolderBase]: 286/575 cut-off events. [2023-11-06 22:03:07,197 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2023-11-06 22:03:07,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 575 events. 286/575 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2840 event pairs, 69 based on Foata normal form. 1/571 useless extension candidates. Maximal degree in co-relation 1362. Up to 234 conditions per place. [2023-11-06 22:03:07,202 INFO L140 encePairwiseOnDemand]: 249/254 looper letters, 56 selfloop transitions, 7 changer transitions 0/66 dead transitions. [2023-11-06 22:03:07,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 66 transitions, 329 flow [2023-11-06 22:03:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:03:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:03:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 698 transitions. [2023-11-06 22:03:07,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.458005249343832 [2023-11-06 22:03:07,210 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 698 transitions. [2023-11-06 22:03:07,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 698 transitions. [2023-11-06 22:03:07,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:03:07,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 698 transitions. [2023-11-06 22:03:07,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:07,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:07,217 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:07,217 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 93 flow. Second operand 6 states and 698 transitions. [2023-11-06 22:03:07,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 66 transitions, 329 flow [2023-11-06 22:03:07,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 66 transitions, 327 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:03:07,222 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 116 flow [2023-11-06 22:03:07,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-11-06 22:03:07,223 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-11-06 22:03:07,223 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 116 flow [2023-11-06 22:03:07,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:07,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:03:07,224 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-06 22:03:07,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:07,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:07,436 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:03:07,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1788209387, now seen corresponding path program 1 times [2023-11-06 22:03:07,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:07,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231381213] [2023-11-06 22:03:07,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:07,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:07,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:07,438 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:03:07,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 22:03:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:07,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:03:07,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:03:08,023 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:03:08,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:03:08,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231381213] [2023-11-06 22:03:08,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231381213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:08,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:08,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:03:08,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079882111] [2023-11-06 22:03:08,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:08,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:03:08,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:03:08,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:03:08,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:03:08,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 254 [2023-11-06 22:03:08,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:08,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:03:08,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 254 [2023-11-06 22:03:08,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:03:08,488 INFO L124 PetriNetUnfolderBase]: 247/495 cut-off events. [2023-11-06 22:03:08,488 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2023-11-06 22:03:08,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 495 events. 247/495 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2408 event pairs, 46 based on Foata normal form. 4/499 useless extension candidates. Maximal degree in co-relation 1338. Up to 409 conditions per place. [2023-11-06 22:03:08,491 INFO L140 encePairwiseOnDemand]: 250/254 looper letters, 23 selfloop transitions, 3 changer transitions 14/44 dead transitions. [2023-11-06 22:03:08,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 241 flow [2023-11-06 22:03:08,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:03:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:03:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-11-06 22:03:08,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2023-11-06 22:03:08,495 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-11-06 22:03:08,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-11-06 22:03:08,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:03:08,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-11-06 22:03:08,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:08,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:08,501 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:08,501 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 116 flow. Second operand 5 states and 508 transitions. [2023-11-06 22:03:08,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 241 flow [2023-11-06 22:03:08,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:03:08,504 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 109 flow [2023-11-06 22:03:08,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-11-06 22:03:08,505 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-11-06 22:03:08,505 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 109 flow [2023-11-06 22:03:08,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:08,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:03:08,506 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-06 22:03:08,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:08,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:08,719 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:03:08,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:08,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1698316576, now seen corresponding path program 3 times [2023-11-06 22:03:08,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:08,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930076075] [2023-11-06 22:03:08,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:03:08,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:08,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:08,721 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:03:08,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 22:03:08,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:03:08,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:03:08,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:03:08,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:03:08,894 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:03:08,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:03:08,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930076075] [2023-11-06 22:03:08,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930076075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:08,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:08,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:03:08,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406566284] [2023-11-06 22:03:08,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:08,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:03:08,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:03:08,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:03:08,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:03:08,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 254 [2023-11-06 22:03:08,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:08,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:03:08,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 254 [2023-11-06 22:03:08,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:03:09,078 INFO L124 PetriNetUnfolderBase]: 206/403 cut-off events. [2023-11-06 22:03:09,078 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2023-11-06 22:03:09,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1099 conditions, 403 events. 206/403 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1631 event pairs, 111 based on Foata normal form. 1/402 useless extension candidates. Maximal degree in co-relation 1092. Up to 156 conditions per place. [2023-11-06 22:03:09,080 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 24 selfloop transitions, 1 changer transitions 27/54 dead transitions. [2023-11-06 22:03:09,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 300 flow [2023-11-06 22:03:09,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:03:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:03:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2023-11-06 22:03:09,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645669291338583 [2023-11-06 22:03:09,084 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2023-11-06 22:03:09,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2023-11-06 22:03:09,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:03:09,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2023-11-06 22:03:09,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:09,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:09,089 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:09,089 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 109 flow. Second operand 4 states and 472 transitions. [2023-11-06 22:03:09,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 300 flow [2023-11-06 22:03:09,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 288 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-11-06 22:03:09,092 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 97 flow [2023-11-06 22:03:09,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2023-11-06 22:03:09,093 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-11-06 22:03:09,093 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 97 flow [2023-11-06 22:03:09,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:09,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:03:09,094 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-06 22:03:09,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:09,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:09,311 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:03:09,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:09,311 INFO L85 PathProgramCache]: Analyzing trace with hash -917565362, now seen corresponding path program 4 times [2023-11-06 22:03:09,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:09,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782646118] [2023-11-06 22:03:09,312 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:03:09,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:09,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:09,314 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:03:09,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 22:03:09,510 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:03:09,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:03:09,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:03:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:03:09,688 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:03:09,688 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:03:09,689 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 22:03:09,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 22:03:09,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 22:03:09,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 22:03:09,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 22:03:09,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 22:03:09,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 22:03:09,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 22:03:09,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 22:03:09,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 22:03:09,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 22:03:09,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 22:03:09,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 22:03:09,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:09,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:09,903 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:09,916 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:03:09,916 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:03:10,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:03:10 BasicIcfg [2023-11-06 22:03:10,008 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:03:10,008 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:03:10,008 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:03:10,008 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:03:10,009 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:02:49" (3/4) ... [2023-11-06 22:03:10,010 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:03:10,011 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:03:10,011 INFO L158 Benchmark]: Toolchain (without parser) took 22572.10ms. Allocated memory was 65.0MB in the beginning and 172.0MB in the end (delta: 107.0MB). Free memory was 30.9MB in the beginning and 134.4MB in the end (delta: -103.5MB). Peak memory consumption was 3.2MB. Max. memory is 16.1GB. [2023-11-06 22:03:10,012 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 65.0MB. Free memory is still 41.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:03:10,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 803.55ms. Allocated memory was 65.0MB in the beginning and 92.3MB in the end (delta: 27.3MB). Free memory was 30.7MB in the beginning and 48.7MB in the end (delta: -18.0MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2023-11-06 22:03:10,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.83ms. Allocated memory is still 92.3MB. Free memory was 48.7MB in the beginning and 69.6MB in the end (delta: -20.9MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2023-11-06 22:03:10,013 INFO L158 Benchmark]: Boogie Preprocessor took 80.20ms. Allocated memory is still 92.3MB. Free memory was 69.6MB in the beginning and 67.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:03:10,014 INFO L158 Benchmark]: RCFGBuilder took 1095.35ms. Allocated memory is still 92.3MB. Free memory was 67.5MB in the beginning and 47.9MB in the end (delta: 19.6MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2023-11-06 22:03:10,014 INFO L158 Benchmark]: TraceAbstraction took 20464.04ms. Allocated memory was 92.3MB in the beginning and 172.0MB in the end (delta: 79.7MB). Free memory was 46.9MB in the beginning and 134.4MB in the end (delta: -87.4MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2023-11-06 22:03:10,014 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 172.0MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:03:10,017 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 65.0MB. Free memory is still 41.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 803.55ms. Allocated memory was 65.0MB in the beginning and 92.3MB in the end (delta: 27.3MB). Free memory was 30.7MB in the beginning and 48.7MB in the end (delta: -18.0MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.83ms. Allocated memory is still 92.3MB. Free memory was 48.7MB in the beginning and 69.6MB in the end (delta: -20.9MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.20ms. Allocated memory is still 92.3MB. Free memory was 69.6MB in the beginning and 67.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1095.35ms. Allocated memory is still 92.3MB. Free memory was 67.5MB in the beginning and 47.9MB in the end (delta: 19.6MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * TraceAbstraction took 20464.04ms. Allocated memory was 92.3MB in the beginning and 172.0MB in the end (delta: 79.7MB). Free memory was 46.9MB in the beginning and 134.4MB in the end (delta: -87.4MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 172.0MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.1s, 131 PlacesBefore, 40 PlacesAfterwards, 124 TransitionsBefore, 30 TransitionsAfterwards, 2522 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 127 TotalNumberOfCompositions, 6594 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2762, independent: 2576, independent conditional: 0, independent unconditional: 2576, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1329, independent: 1290, independent conditional: 0, independent unconditional: 1290, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2762, independent: 1286, independent conditional: 0, independent unconditional: 1286, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 1329, unknown conditional: 0, unknown unconditional: 1329] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1403; [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1403, ((void *)0), P0, ((void *)0))=0, t1403={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L822] 0 pthread_t t1404; [L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1404, ((void *)0), P1, ((void *)0))=1, t1403={3:0}, t1404={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L824] 0 pthread_t t1405; [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1405, ((void *)0), P2, ((void *)0))=2, t1403={3:0}, t1404={7:0}, t1405={15:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={3:0}, t1404={7:0}, t1405={15:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={3:0}, t1404={7:0}, t1405={15:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix052_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={5:6}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 821]: 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: 825]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 395 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 898 IncrementalHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 20 mSDtfsCounter, 898 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=5, InterpolantAutomatonStates: 39, 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.4s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 1256 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1110 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:03:10,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ab24097-0f54-4c02-8546-22982050265a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample