./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 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_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 62e921ac3b02bdecb866366797768eb8fcdb22a87147dc14adf7fddb42ab9cb2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:29:29,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:29:29,448 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-23 22:29:29,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:29:29,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:29:29,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:29:29,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:29:29,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:29:29,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:29:29,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:29:29,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:29:29,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:29:29,522 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:29:29,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:29:29,526 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:29:29,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:29:29,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:29:29,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:29:29,528 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 22:29:29,529 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 22:29:29,529 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 22:29:29,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:29:29,531 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 22:29:29,531 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 22:29:29,532 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:29:29,532 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:29:29,533 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:29:29,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:29:29,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:29:29,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:29:29,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:29:29,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:29:29,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:29:29,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:29:29,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:29:29,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:29:29,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:29:29,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:29:29,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:29:29,540 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_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 62e921ac3b02bdecb866366797768eb8fcdb22a87147dc14adf7fddb42ab9cb2 [2023-11-23 22:29:29,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:29:29,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:29:29,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:29:29,887 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:29:29,888 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:29:29,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/pthread-wmm/rfi007_tso.i [2023-11-23 22:29:33,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:29:33,507 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:29:33,508 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/sv-benchmarks/c/pthread-wmm/rfi007_tso.i [2023-11-23 22:29:33,541 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/data/e5f25a15d/9c47092f99d340de8a28ae8a45412508/FLAG8307d4793 [2023-11-23 22:29:33,566 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/data/e5f25a15d/9c47092f99d340de8a28ae8a45412508 [2023-11-23 22:29:33,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:29:33,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:29:33,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:29:33,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:29:33,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:29:33,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:29:33" (1/1) ... [2023-11-23 22:29:33,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43f794dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:33, skipping insertion in model container [2023-11-23 22:29:33,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:29:33" (1/1) ... [2023-11-23 22:29:33,656 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:29:34,281 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:29:34,295 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:29:34,402 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:29:34,465 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:29:34,465 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:29:34,473 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:29:34,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:34 WrapperNode [2023-11-23 22:29:34,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:29:34,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:29:34,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:29:34,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:29:34,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:34" (1/1) ... [2023-11-23 22:29:34,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:34" (1/1) ... [2023-11-23 22:29:34,579 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 155 [2023-11-23 22:29:34,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:29:34,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:29:34,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:29:34,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:29:34,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:34" (1/1) ... [2023-11-23 22:29:34,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:34" (1/1) ... [2023-11-23 22:29:34,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:34" (1/1) ... [2023-11-23 22:29:34,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:34" (1/1) ... [2023-11-23 22:29:34,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:34" (1/1) ... [2023-11-23 22:29:34,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:34" (1/1) ... [2023-11-23 22:29:34,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:34" (1/1) ... [2023-11-23 22:29:34,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:34" (1/1) ... [2023-11-23 22:29:34,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:29:34,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:29:34,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:29:34,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:29:34,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:34" (1/1) ... [2023-11-23 22:29:34,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:29:34,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:29:34,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:29:34,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:29:34,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 22:29:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 22:29:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:29:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 22:29:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 22:29:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 22:29:34,759 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 22:29:34,760 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 22:29:34,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 22:29:34,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 22:29:34,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 22:29:34,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:29:34,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:29:34,763 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 22:29:34,968 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:29:34,971 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:29:35,530 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:29:35,828 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:29:35,828 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 22:29:35,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:35 BoogieIcfgContainer [2023-11-23 22:29:35,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:29:35,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:29:35,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:29:35,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:29:35,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:29:33" (1/3) ... [2023-11-23 22:29:35,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2c8c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:29:35, skipping insertion in model container [2023-11-23 22:29:35,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:34" (2/3) ... [2023-11-23 22:29:35,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2c8c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:29:35, skipping insertion in model container [2023-11-23 22:29:35,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:35" (3/3) ... [2023-11-23 22:29:35,845 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_tso.i [2023-11-23 22:29:35,874 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:29:35,875 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-23 22:29:35,875 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 22:29:35,937 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 22:29:35,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 92 flow [2023-11-23 22:29:36,044 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-23 22:29:36,046 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 22:29:36,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-11-23 22:29:36,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 42 transitions, 92 flow [2023-11-23 22:29:36,064 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 40 transitions, 86 flow [2023-11-23 22:29:36,086 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:29:36,103 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;@21429adc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:29:36,103 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-23 22:29:36,109 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 22:29:36,109 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-23 22:29:36,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 22:29:36,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:36,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 22:29:36,111 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:36,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:36,118 INFO L85 PathProgramCache]: Analyzing trace with hash 12693, now seen corresponding path program 1 times [2023-11-23 22:29:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662786517] [2023-11-23 22:29:36,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:36,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:36,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-23 22:29:36,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:36,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662786517] [2023-11-23 22:29:36,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662786517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:36,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:36,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:29:36,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125685252] [2023-11-23 22:29:36,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:36,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:36,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:36,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:36,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:36,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-23 22:29:36,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:36,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:36,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-23 22:29:36,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:36,936 INFO L124 PetriNetUnfolderBase]: 230/516 cut-off events. [2023-11-23 22:29:36,936 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-23 22:29:36,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 516 events. 230/516 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3111 event pairs, 176 based on Foata normal form. 36/508 useless extension candidates. Maximal degree in co-relation 915. Up to 310 conditions per place. [2023-11-23 22:29:36,945 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 25 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-23 22:29:36,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 146 flow [2023-11-23 22:29:36,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:36,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-23 22:29:36,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-23 22:29:36,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-23 22:29:36,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-23 22:29:36,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:36,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-23 22:29:36,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:36,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:36,975 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:36,977 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 86 flow. Second operand 3 states and 84 transitions. [2023-11-23 22:29:36,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 146 flow [2023-11-23 22:29:36,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:36,985 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-23 22:29:36,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-23 22:29:36,993 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-23 22:29:36,994 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-23 22:29:36,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:36,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:36,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 22:29:36,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 22:29:36,996 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:36,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:36,998 INFO L85 PathProgramCache]: Analyzing trace with hash 12694, now seen corresponding path program 1 times [2023-11-23 22:29:36,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:36,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881505787] [2023-11-23 22:29:36,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:36,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:37,166 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-23 22:29:37,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:37,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881505787] [2023-11-23 22:29:37,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881505787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:37,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:37,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:29:37,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772355995] [2023-11-23 22:29:37,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:37,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:37,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:37,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:37,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:37,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-23 22:29:37,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:37,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:37,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-23 22:29:37,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:37,411 INFO L124 PetriNetUnfolderBase]: 230/515 cut-off events. [2023-11-23 22:29:37,412 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-23 22:29:37,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 515 events. 230/515 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3086 event pairs, 176 based on Foata normal form. 1/472 useless extension candidates. Maximal degree in co-relation 933. Up to 309 conditions per place. [2023-11-23 22:29:37,421 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 24 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-23 22:29:37,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 144 flow [2023-11-23 22:29:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-23 22:29:37,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-23 22:29:37,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-23 22:29:37,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-23 22:29:37,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:37,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-23 22:29:37,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:37,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:37,433 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:37,434 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 84 transitions. [2023-11-23 22:29:37,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 144 flow [2023-11-23 22:29:37,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:37,441 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-23 22:29:37,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-23 22:29:37,442 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-23 22:29:37,443 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-23 22:29:37,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:37,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:37,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 22:29:37,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 22:29:37,445 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:37,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:37,449 INFO L85 PathProgramCache]: Analyzing trace with hash 378489340, now seen corresponding path program 1 times [2023-11-23 22:29:37,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:37,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615037489] [2023-11-23 22:29:37,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:37,552 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-23 22:29:37,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:37,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615037489] [2023-11-23 22:29:37,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615037489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:37,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:37,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:29:37,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919603254] [2023-11-23 22:29:37,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:37,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:37,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:37,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:37,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:37,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-23 22:29:37,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:37,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:37,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-23 22:29:37,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:37,749 INFO L124 PetriNetUnfolderBase]: 232/507 cut-off events. [2023-11-23 22:29:37,749 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-23 22:29:37,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 507 events. 232/507 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3009 event pairs, 182 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 930. Up to 310 conditions per place. [2023-11-23 22:29:37,755 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 25 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-23 22:29:37,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 144 flow [2023-11-23 22:29:37,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:37,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2023-11-23 22:29:37,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2023-11-23 22:29:37,758 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 82 transitions. [2023-11-23 22:29:37,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 82 transitions. [2023-11-23 22:29:37,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:37,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 82 transitions. [2023-11-23 22:29:37,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:37,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:37,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:37,761 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 82 transitions. [2023-11-23 22:29:37,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 144 flow [2023-11-23 22:29:37,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:37,764 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-23 22:29:37,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-11-23 22:29:37,766 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-23 22:29:37,766 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-23 22:29:37,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:37,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:37,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 22:29:37,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 22:29:37,768 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:37,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:37,769 INFO L85 PathProgramCache]: Analyzing trace with hash 378489341, now seen corresponding path program 1 times [2023-11-23 22:29:37,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:37,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326036694] [2023-11-23 22:29:37,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:37,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:37,857 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-23 22:29:37,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:37,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326036694] [2023-11-23 22:29:37,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326036694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:37,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:37,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:29:37,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201462233] [2023-11-23 22:29:37,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:37,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:37,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:37,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:37,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:37,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-23 22:29:37,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:37,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:37,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-23 22:29:37,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:38,014 INFO L124 PetriNetUnfolderBase]: 230/509 cut-off events. [2023-11-23 22:29:38,014 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-23 22:29:38,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 509 events. 230/509 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3073 event pairs, 114 based on Foata normal form. 3/475 useless extension candidates. Maximal degree in co-relation 930. Up to 305 conditions per place. [2023-11-23 22:29:38,019 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 24 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-11-23 22:29:38,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 140 flow [2023-11-23 22:29:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-23 22:29:38,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-23 22:29:38,022 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-23 22:29:38,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-23 22:29:38,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:38,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-23 22:29:38,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:38,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:38,025 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:38,025 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 84 transitions. [2023-11-23 22:29:38,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 140 flow [2023-11-23 22:29:38,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:38,030 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 74 flow [2023-11-23 22:29:38,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-11-23 22:29:38,032 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-11-23 22:29:38,032 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 74 flow [2023-11-23 22:29:38,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:38,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:38,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:38,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 22:29:38,034 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:38,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:38,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1287127174, now seen corresponding path program 1 times [2023-11-23 22:29:38,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:38,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985777103] [2023-11-23 22:29:38,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:38,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:38,172 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-23 22:29:38,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:38,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985777103] [2023-11-23 22:29:38,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985777103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:38,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:38,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:29:38,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542560720] [2023-11-23 22:29:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:38,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:38,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:38,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:38,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:38,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-23 22:29:38,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:38,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:38,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-23 22:29:38,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:38,344 INFO L124 PetriNetUnfolderBase]: 188/410 cut-off events. [2023-11-23 22:29:38,344 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-23 22:29:38,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 410 events. 188/410 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2224 event pairs, 20 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 759. Up to 277 conditions per place. [2023-11-23 22:29:38,349 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 24 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-23 22:29:38,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 150 flow [2023-11-23 22:29:38,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-23 22:29:38,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7063492063492064 [2023-11-23 22:29:38,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-23 22:29:38,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-23 22:29:38,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:38,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-23 22:29:38,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:38,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:38,358 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:38,358 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 74 flow. Second operand 3 states and 89 transitions. [2023-11-23 22:29:38,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 150 flow [2023-11-23 22:29:38,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:38,360 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2023-11-23 22:29:38,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-11-23 22:29:38,361 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2023-11-23 22:29:38,361 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2023-11-23 22:29:38,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:38,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:38,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:38,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 22:29:38,362 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:38,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:38,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1059029559, now seen corresponding path program 1 times [2023-11-23 22:29:38,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:38,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253662052] [2023-11-23 22:29:38,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:38,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:38,788 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-23 22:29:38,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:38,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253662052] [2023-11-23 22:29:38,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253662052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:38,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:38,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:29:38,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256039138] [2023-11-23 22:29:38,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:38,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:29:38,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:38,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:29:38,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:29:38,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-23 22:29:38,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:38,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:38,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-23 22:29:38,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:39,024 INFO L124 PetriNetUnfolderBase]: 166/372 cut-off events. [2023-11-23 22:29:39,025 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-23 22:29:39,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 372 events. 166/372 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2024 event pairs, 142 based on Foata normal form. 15/378 useless extension candidates. Maximal degree in co-relation 690. Up to 252 conditions per place. [2023-11-23 22:29:39,028 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 17 selfloop transitions, 2 changer transitions 7/38 dead transitions. [2023-11-23 22:29:39,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 138 flow [2023-11-23 22:29:39,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 22:29:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-23 22:29:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2023-11-23 22:29:39,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2023-11-23 22:29:39,031 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 112 transitions. [2023-11-23 22:29:39,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 112 transitions. [2023-11-23 22:29:39,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:39,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 112 transitions. [2023-11-23 22:29:39,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:39,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:39,034 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:39,034 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 5 states and 112 transitions. [2023-11-23 22:29:39,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 138 flow [2023-11-23 22:29:39,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:39,036 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-11-23 22:29:39,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-11-23 22:29:39,038 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2023-11-23 22:29:39,038 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-11-23 22:29:39,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:39,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:39,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:39,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 22:29:39,039 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:39,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1059030954, now seen corresponding path program 1 times [2023-11-23 22:29:39,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:39,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156180789] [2023-11-23 22:29:39,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:39,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:40,026 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-23 22:29:40,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:40,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156180789] [2023-11-23 22:29:40,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156180789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:40,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:40,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:29:40,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971791859] [2023-11-23 22:29:40,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:40,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 22:29:40,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:40,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 22:29:40,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:29:40,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2023-11-23 22:29:40,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:40,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:40,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2023-11-23 22:29:40,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:40,550 INFO L124 PetriNetUnfolderBase]: 398/735 cut-off events. [2023-11-23 22:29:40,550 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-23 22:29:40,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1436 conditions, 735 events. 398/735 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3734 event pairs, 63 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 1425. Up to 354 conditions per place. [2023-11-23 22:29:40,556 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 28 selfloop transitions, 4 changer transitions 44/85 dead transitions. [2023-11-23 22:29:40,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 85 transitions, 334 flow [2023-11-23 22:29:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 22:29:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-23 22:29:40,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 255 transitions. [2023-11-23 22:29:40,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.551948051948052 [2023-11-23 22:29:40,560 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 255 transitions. [2023-11-23 22:29:40,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 255 transitions. [2023-11-23 22:29:40,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:40,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 255 transitions. [2023-11-23 22:29:40,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 23.181818181818183) internal successors, (255), 11 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:40,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 42.0) internal successors, (504), 12 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:40,566 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 42.0) internal successors, (504), 12 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:40,567 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 11 states and 255 transitions. [2023-11-23 22:29:40,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 85 transitions, 334 flow [2023-11-23 22:29:40,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 85 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:40,570 INFO L231 Difference]: Finished difference. Result has 53 places, 30 transitions, 100 flow [2023-11-23 22:29:40,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=100, PETRI_PLACES=53, PETRI_TRANSITIONS=30} [2023-11-23 22:29:40,572 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-11-23 22:29:40,572 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 30 transitions, 100 flow [2023-11-23 22:29:40,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:40,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:40,573 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-23 22:29:40,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 22:29:40,573 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:40,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:40,574 INFO L85 PathProgramCache]: Analyzing trace with hash -288371124, now seen corresponding path program 1 times [2023-11-23 22:29:40,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:40,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244397200] [2023-11-23 22:29:40,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:40,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:40,802 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-23 22:29:40,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:40,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244397200] [2023-11-23 22:29:40,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244397200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:40,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:40,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:29:40,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300950129] [2023-11-23 22:29:40,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:40,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:29:40,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:40,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:29:40,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:29:40,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-23 22:29:40,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 30 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:40,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:40,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-23 22:29:40,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:40,995 INFO L124 PetriNetUnfolderBase]: 195/404 cut-off events. [2023-11-23 22:29:40,995 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2023-11-23 22:29:40,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 404 events. 195/404 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1821 event pairs, 37 based on Foata normal form. 24/425 useless extension candidates. Maximal degree in co-relation 991. Up to 199 conditions per place. [2023-11-23 22:29:41,000 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 32 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-11-23 22:29:41,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 228 flow [2023-11-23 22:29:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:29:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 22:29:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2023-11-23 22:29:41,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6369047619047619 [2023-11-23 22:29:41,002 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 107 transitions. [2023-11-23 22:29:41,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 107 transitions. [2023-11-23 22:29:41,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:41,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 107 transitions. [2023-11-23 22:29:41,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:41,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:41,004 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:41,004 INFO L175 Difference]: Start difference. First operand has 53 places, 30 transitions, 100 flow. Second operand 4 states and 107 transitions. [2023-11-23 22:29:41,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 228 flow [2023-11-23 22:29:41,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 216 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-23 22:29:41,015 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 125 flow [2023-11-23 22:29:41,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-11-23 22:29:41,018 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2023-11-23 22:29:41,018 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 125 flow [2023-11-23 22:29:41,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:41,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:41,019 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-23 22:29:41,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 22:29:41,019 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:41,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:41,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1952482250, now seen corresponding path program 1 times [2023-11-23 22:29:41,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:41,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667864787] [2023-11-23 22:29:41,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:41,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:41,352 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-23 22:29:41,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:41,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667864787] [2023-11-23 22:29:41,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667864787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:41,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:41,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:29:41,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767504995] [2023-11-23 22:29:41,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:41,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:29:41,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:41,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:29:41,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:29:41,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-23 22:29:41,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:41,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:41,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-23 22:29:41,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:41,528 INFO L124 PetriNetUnfolderBase]: 101/224 cut-off events. [2023-11-23 22:29:41,528 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2023-11-23 22:29:41,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 224 events. 101/224 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 742 event pairs, 29 based on Foata normal form. 16/237 useless extension candidates. Maximal degree in co-relation 577. Up to 86 conditions per place. [2023-11-23 22:29:41,531 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 27 selfloop transitions, 7 changer transitions 1/44 dead transitions. [2023-11-23 22:29:41,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 225 flow [2023-11-23 22:29:41,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 22:29:41,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-23 22:29:41,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2023-11-23 22:29:41,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5761904761904761 [2023-11-23 22:29:41,533 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 121 transitions. [2023-11-23 22:29:41,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 121 transitions. [2023-11-23 22:29:41,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:41,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 121 transitions. [2023-11-23 22:29:41,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:41,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:41,535 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:41,535 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 125 flow. Second operand 5 states and 121 transitions. [2023-11-23 22:29:41,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 225 flow [2023-11-23 22:29:41,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 197 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-23 22:29:41,541 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 125 flow [2023-11-23 22:29:41,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-11-23 22:29:41,542 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-11-23 22:29:41,542 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 125 flow [2023-11-23 22:29:41,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:41,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:41,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:41,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 22:29:41,543 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:41,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:41,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1756583879, now seen corresponding path program 1 times [2023-11-23 22:29:41,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:41,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779939246] [2023-11-23 22:29:41,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:41,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:42,552 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-23 22:29:42,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:42,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779939246] [2023-11-23 22:29:42,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779939246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:42,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:42,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 22:29:42,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885969689] [2023-11-23 22:29:42,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:42,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 22:29:42,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:42,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 22:29:42,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:29:42,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-23 22:29:42,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 125 flow. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:42,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:42,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-23 22:29:42,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:42,944 INFO L124 PetriNetUnfolderBase]: 121/290 cut-off events. [2023-11-23 22:29:42,944 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2023-11-23 22:29:42,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 290 events. 121/290 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1079 event pairs, 18 based on Foata normal form. 4/289 useless extension candidates. Maximal degree in co-relation 675. Up to 129 conditions per place. [2023-11-23 22:29:42,947 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 19 selfloop transitions, 3 changer transitions 26/60 dead transitions. [2023-11-23 22:29:42,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 289 flow [2023-11-23 22:29:42,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 22:29:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-23 22:29:42,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2023-11-23 22:29:42,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2023-11-23 22:29:42,949 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 183 transitions. [2023-11-23 22:29:42,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 183 transitions. [2023-11-23 22:29:42,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:42,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 183 transitions. [2023-11-23 22:29:42,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:42,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:42,952 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:42,953 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 125 flow. Second operand 8 states and 183 transitions. [2023-11-23 22:29:42,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 289 flow [2023-11-23 22:29:42,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 249 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-11-23 22:29:42,956 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 98 flow [2023-11-23 22:29:42,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=98, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2023-11-23 22:29:42,958 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-11-23 22:29:42,959 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 98 flow [2023-11-23 22:29:42,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:42,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:42,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:42,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 22:29:42,960 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:42,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:42,961 INFO L85 PathProgramCache]: Analyzing trace with hash 805619633, now seen corresponding path program 2 times [2023-11-23 22:29:42,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:42,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437634316] [2023-11-23 22:29:42,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:42,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:45,136 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-23 22:29:45,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:45,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437634316] [2023-11-23 22:29:45,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437634316] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:45,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:45,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 22:29:45,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631546700] [2023-11-23 22:29:45,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:45,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 22:29:45,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:45,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 22:29:45,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:29:45,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-23 22:29:45,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 30 transitions, 98 flow. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:45,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:45,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-23 22:29:45,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:45,559 INFO L124 PetriNetUnfolderBase]: 88/228 cut-off events. [2023-11-23 22:29:45,560 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-23 22:29:45,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 228 events. 88/228 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 822 event pairs, 26 based on Foata normal form. 4/223 useless extension candidates. Maximal degree in co-relation 493. Up to 92 conditions per place. [2023-11-23 22:29:45,562 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 18 selfloop transitions, 5 changer transitions 12/47 dead transitions. [2023-11-23 22:29:45,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 210 flow [2023-11-23 22:29:45,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 22:29:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-23 22:29:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2023-11-23 22:29:45,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2023-11-23 22:29:45,565 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 172 transitions. [2023-11-23 22:29:45,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 172 transitions. [2023-11-23 22:29:45,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:45,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 172 transitions. [2023-11-23 22:29:45,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:45,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:45,568 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:45,568 INFO L175 Difference]: Start difference. First operand has 52 places, 30 transitions, 98 flow. Second operand 8 states and 172 transitions. [2023-11-23 22:29:45,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 210 flow [2023-11-23 22:29:45,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 191 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-11-23 22:29:45,572 INFO L231 Difference]: Finished difference. Result has 51 places, 30 transitions, 104 flow [2023-11-23 22:29:45,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=104, PETRI_PLACES=51, PETRI_TRANSITIONS=30} [2023-11-23 22:29:45,573 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2023-11-23 22:29:45,573 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 30 transitions, 104 flow [2023-11-23 22:29:45,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:45,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:45,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:45,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 22:29:45,575 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:45,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:45,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1578641329, now seen corresponding path program 3 times [2023-11-23 22:29:45,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:45,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052809310] [2023-11-23 22:29:45,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:45,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:29:45,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:29:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:29:45,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:29:45,757 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 22:29:45,758 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-23 22:29:45,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-23 22:29:45,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-23 22:29:45,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-23 22:29:45,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-23 22:29:45,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-23 22:29:45,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-23 22:29:45,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-23 22:29:45,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-23 22:29:45,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-23 22:29:45,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 22:29:45,763 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:45,770 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 22:29:45,770 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 22:29:45,833 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 22:29:45,835 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-23 22:29:45,843 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 22:29:45,844 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 22:29:45,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:29:45 BasicIcfg [2023-11-23 22:29:45,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 22:29:45,870 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 22:29:45,871 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 22:29:45,871 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 22:29:45,871 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:35" (3/4) ... [2023-11-23 22:29:45,873 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 22:29:45,875 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 22:29:45,876 INFO L158 Benchmark]: Toolchain (without parser) took 12303.70ms. Allocated memory was 155.2MB in the beginning and 352.3MB in the end (delta: 197.1MB). Free memory was 108.6MB in the beginning and 249.1MB in the end (delta: -140.5MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. [2023-11-23 22:29:45,876 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 155.2MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:29:45,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 899.84ms. Allocated memory is still 155.2MB. Free memory was 108.6MB in the beginning and 84.4MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-23 22:29:45,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.57ms. Allocated memory is still 155.2MB. Free memory was 84.4MB in the beginning and 81.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 22:29:45,879 INFO L158 Benchmark]: Boogie Preprocessor took 82.54ms. Allocated memory is still 155.2MB. Free memory was 81.4MB in the beginning and 79.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 22:29:45,880 INFO L158 Benchmark]: RCFGBuilder took 1166.64ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 79.3MB in the beginning and 130.3MB in the end (delta: -51.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2023-11-23 22:29:45,881 INFO L158 Benchmark]: TraceAbstraction took 10034.13ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 129.2MB in the beginning and 249.1MB in the end (delta: -119.9MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2023-11-23 22:29:45,883 INFO L158 Benchmark]: Witness Printer took 4.36ms. Allocated memory is still 352.3MB. Free memory is still 249.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:29:45,885 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 155.2MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 899.84ms. Allocated memory is still 155.2MB. Free memory was 108.6MB in the beginning and 84.4MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.57ms. Allocated memory is still 155.2MB. Free memory was 84.4MB in the beginning and 81.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.54ms. Allocated memory is still 155.2MB. Free memory was 81.4MB in the beginning and 79.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1166.64ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 79.3MB in the beginning and 130.3MB in the end (delta: -51.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10034.13ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 129.2MB in the beginning and 249.1MB in the end (delta: -119.9MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * Witness Printer took 4.36ms. Allocated memory is still 352.3MB. Free memory is still 249.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1717; [L811] FCALL, FORK 0 pthread_create(&t1717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1717={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L812] 0 pthread_t t1718; [L813] FCALL, FORK 0 pthread_create(&t1718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L758] 2 y$w_buff1 = y$w_buff0 [L759] 2 y$w_buff0 = 2 [L760] 2 y$w_buff1_used = y$w_buff0_used [L761] 2 y$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L763] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L764] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L765] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L766] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EAX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L744] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L745] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L747] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L748] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L826] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 0 y$flush_delayed = weak$$choice2 [L829] 0 y$mem_tmp = y [L830] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L831] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L832] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L833] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L834] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L836] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L838] 0 y = y$flush_delayed ? y$mem_tmp : y [L839] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "rfi007_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 808]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 59 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 388 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 320 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 839 IncrementalHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 29 mSDtfsCounter, 839 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=8, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 1116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-23 22:29:45,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 62e921ac3b02bdecb866366797768eb8fcdb22a87147dc14adf7fddb42ab9cb2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:29:48,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:29:48,863 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-23 22:29:48,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:29:48,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:29:48,922 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:29:48,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:29:48,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:29:48,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:29:48,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:29:48,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:29:48,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:29:48,932 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:29:48,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:29:48,935 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:29:48,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:29:48,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:29:48,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:29:48,937 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 22:29:48,939 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 22:29:48,939 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 22:29:48,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:29:48,940 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 22:29:48,941 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 22:29:48,941 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 22:29:48,942 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 22:29:48,942 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:29:48,943 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:29:48,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:29:48,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:29:48,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:29:48,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:29:48,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:29:48,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:29:48,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:29:48,949 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 22:29:48,949 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 22:29:48,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:29:48,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:29:48,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:29:48,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:29:48,952 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 22:29:48,952 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_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 62e921ac3b02bdecb866366797768eb8fcdb22a87147dc14adf7fddb42ab9cb2 [2023-11-23 22:29:49,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:29:49,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:29:49,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:29:49,415 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:29:49,415 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:29:49,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/pthread-wmm/rfi007_tso.i [2023-11-23 22:29:52,829 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:29:53,204 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:29:53,219 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/sv-benchmarks/c/pthread-wmm/rfi007_tso.i [2023-11-23 22:29:53,251 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/data/f2a0c598c/ce7eff978fed4e7ca5f1623efacfcd0a/FLAG5a160c869 [2023-11-23 22:29:53,273 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/data/f2a0c598c/ce7eff978fed4e7ca5f1623efacfcd0a [2023-11-23 22:29:53,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:29:53,281 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:29:53,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:29:53,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:29:53,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:29:53,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:29:53" (1/1) ... [2023-11-23 22:29:53,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@448bdcd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:53, skipping insertion in model container [2023-11-23 22:29:53,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:29:53" (1/1) ... [2023-11-23 22:29:53,359 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:29:53,938 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:29:53,955 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:29:54,026 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:29:54,138 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:29:54,138 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:29:54,146 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:29:54,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:54 WrapperNode [2023-11-23 22:29:54,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:29:54,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:29:54,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:29:54,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:29:54,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:54" (1/1) ... [2023-11-23 22:29:54,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:54" (1/1) ... [2023-11-23 22:29:54,248 INFO L138 Inliner]: procedures = 178, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156 [2023-11-23 22:29:54,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:29:54,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:29:54,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:29:54,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:29:54,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:54" (1/1) ... [2023-11-23 22:29:54,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:54" (1/1) ... [2023-11-23 22:29:54,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:54" (1/1) ... [2023-11-23 22:29:54,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:54" (1/1) ... [2023-11-23 22:29:54,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:54" (1/1) ... [2023-11-23 22:29:54,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:54" (1/1) ... [2023-11-23 22:29:54,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:54" (1/1) ... [2023-11-23 22:29:54,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:54" (1/1) ... [2023-11-23 22:29:54,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:29:54,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:29:54,294 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:29:54,294 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:29:54,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:54" (1/1) ... [2023-11-23 22:29:54,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:29:54,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:29:54,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:29:54,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:29:54,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 22:29:54,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:29:54,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 22:29:54,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 22:29:54,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-23 22:29:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-23 22:29:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 22:29:54,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 22:29:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 22:29:54,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 22:29:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 22:29:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:29:54,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:29:54,406 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 22:29:54,569 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:29:54,571 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:29:55,062 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:29:55,353 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:29:55,353 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 22:29:55,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:55 BoogieIcfgContainer [2023-11-23 22:29:55,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:29:55,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:29:55,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:29:55,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:29:55,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:29:53" (1/3) ... [2023-11-23 22:29:55,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ed9b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:29:55, skipping insertion in model container [2023-11-23 22:29:55,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:54" (2/3) ... [2023-11-23 22:29:55,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ed9b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:29:55, skipping insertion in model container [2023-11-23 22:29:55,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:55" (3/3) ... [2023-11-23 22:29:55,363 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_tso.i [2023-11-23 22:29:55,385 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:29:55,385 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-23 22:29:55,385 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 22:29:55,458 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 22:29:55,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 92 flow [2023-11-23 22:29:55,529 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-23 22:29:55,530 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 22:29:55,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-11-23 22:29:55,542 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 42 transitions, 92 flow [2023-11-23 22:29:55,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 40 transitions, 86 flow [2023-11-23 22:29:55,567 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:29:55,580 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;@2f445ea0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:29:55,580 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-23 22:29:55,583 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 22:29:55,583 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-23 22:29:55,584 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 22:29:55,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:55,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 22:29:55,585 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:55,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:55,595 INFO L85 PathProgramCache]: Analyzing trace with hash 12757, now seen corresponding path program 1 times [2023-11-23 22:29:55,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:29:55,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527805405] [2023-11-23 22:29:55,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:55,615 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-23 22:29:55,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:29:55,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:55,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:55,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 22:29:55,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:29:55,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-23 22:29:55,822 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-23 22:29:55,822 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:29:55,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:29:55,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527805405] [2023-11-23 22:29:55,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527805405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:55,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:55,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:29:55,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98068059] [2023-11-23 22:29:55,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:55,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:55,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:29:55,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:55,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:55,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-23 22:29:55,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:55,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:55,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-23 22:29:55,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:56,294 INFO L124 PetriNetUnfolderBase]: 230/516 cut-off events. [2023-11-23 22:29:56,294 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-23 22:29:56,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 516 events. 230/516 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3091 event pairs, 176 based on Foata normal form. 36/508 useless extension candidates. Maximal degree in co-relation 915. Up to 310 conditions per place. [2023-11-23 22:29:56,308 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 25 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-23 22:29:56,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 146 flow [2023-11-23 22:29:56,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-23 22:29:56,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-23 22:29:56,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-23 22:29:56,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-23 22:29:56,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:56,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-23 22:29:56,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:56,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:56,343 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:56,345 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 86 flow. Second operand 3 states and 84 transitions. [2023-11-23 22:29:56,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 146 flow [2023-11-23 22:29:56,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:56,355 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-23 22:29:56,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-23 22:29:56,363 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-23 22:29:56,363 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-23 22:29:56,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:56,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:56,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 22:29:56,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:56,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:56,575 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:56,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:56,575 INFO L85 PathProgramCache]: Analyzing trace with hash 12758, now seen corresponding path program 1 times [2023-11-23 22:29:56,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:29:56,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117584473] [2023-11-23 22:29:56,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:56,577 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-23 22:29:56,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:29:56,608 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:56,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:56,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 22:29:56,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:29:56,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 22:29:56,738 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-23 22:29:56,739 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:29:56,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:29:56,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117584473] [2023-11-23 22:29:56,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117584473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:56,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:56,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:29:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105800818] [2023-11-23 22:29:56,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:56,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:56,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:29:56,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:56,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:56,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-23 22:29:56,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:56,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:56,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-23 22:29:56,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:57,034 INFO L124 PetriNetUnfolderBase]: 230/515 cut-off events. [2023-11-23 22:29:57,034 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-23 22:29:57,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 515 events. 230/515 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3076 event pairs, 176 based on Foata normal form. 1/472 useless extension candidates. Maximal degree in co-relation 933. Up to 309 conditions per place. [2023-11-23 22:29:57,042 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 24 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-23 22:29:57,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 144 flow [2023-11-23 22:29:57,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-23 22:29:57,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-23 22:29:57,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-23 22:29:57,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-23 22:29:57,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:57,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-23 22:29:57,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:57,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:57,057 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:57,058 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 84 transitions. [2023-11-23 22:29:57,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 144 flow [2023-11-23 22:29:57,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:57,070 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-23 22:29:57,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-23 22:29:57,073 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-23 22:29:57,073 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-23 22:29:57,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:57,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:57,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 22:29:57,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:57,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:57,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:57,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash 380396028, now seen corresponding path program 1 times [2023-11-23 22:29:57,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:29:57,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48819893] [2023-11-23 22:29:57,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:57,278 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-23 22:29:57,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:29:57,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:57,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:57,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 22:29:57,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:29:57,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-23 22:29:57,421 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-23 22:29:57,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:29:57,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:29:57,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48819893] [2023-11-23 22:29:57,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48819893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:57,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:57,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:29:57,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372143619] [2023-11-23 22:29:57,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:57,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:57,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:29:57,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:57,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:57,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-23 22:29:57,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:57,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:57,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-23 22:29:57,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:57,651 INFO L124 PetriNetUnfolderBase]: 232/507 cut-off events. [2023-11-23 22:29:57,652 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-23 22:29:57,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 507 events. 232/507 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2996 event pairs, 182 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 930. Up to 310 conditions per place. [2023-11-23 22:29:57,657 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 25 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-23 22:29:57,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 144 flow [2023-11-23 22:29:57,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2023-11-23 22:29:57,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2023-11-23 22:29:57,662 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 82 transitions. [2023-11-23 22:29:57,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 82 transitions. [2023-11-23 22:29:57,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:57,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 82 transitions. [2023-11-23 22:29:57,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:57,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:57,666 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:57,666 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 82 transitions. [2023-11-23 22:29:57,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 144 flow [2023-11-23 22:29:57,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:57,669 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-23 22:29:57,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-11-23 22:29:57,671 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-23 22:29:57,674 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-23 22:29:57,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:57,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:57,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 22:29:57,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:57,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:57,878 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:57,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:57,878 INFO L85 PathProgramCache]: Analyzing trace with hash 380396029, now seen corresponding path program 1 times [2023-11-23 22:29:57,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:29:57,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521728385] [2023-11-23 22:29:57,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:57,879 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-23 22:29:57,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:29:57,881 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:57,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:57,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 22:29:57,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:29:57,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 22:29:58,011 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-23 22:29:58,012 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:29:58,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:29:58,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521728385] [2023-11-23 22:29:58,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521728385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:58,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:58,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:29:58,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180300537] [2023-11-23 22:29:58,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:58,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:58,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:29:58,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:58,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:58,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-23 22:29:58,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:58,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:58,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-23 22:29:58,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:58,229 INFO L124 PetriNetUnfolderBase]: 230/509 cut-off events. [2023-11-23 22:29:58,230 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-23 22:29:58,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 509 events. 230/509 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3055 event pairs, 114 based on Foata normal form. 3/476 useless extension candidates. Maximal degree in co-relation 930. Up to 305 conditions per place. [2023-11-23 22:29:58,236 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 24 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-11-23 22:29:58,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 140 flow [2023-11-23 22:29:58,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-23 22:29:58,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-23 22:29:58,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-23 22:29:58,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-23 22:29:58,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:58,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-23 22:29:58,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:58,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:58,244 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:58,245 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 84 transitions. [2023-11-23 22:29:58,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 140 flow [2023-11-23 22:29:58,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:58,253 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 74 flow [2023-11-23 22:29:58,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-11-23 22:29:58,255 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-11-23 22:29:58,256 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 74 flow [2023-11-23 22:29:58,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:58,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:58,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:58,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:58,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:58,461 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:58,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:58,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2040268854, now seen corresponding path program 1 times [2023-11-23 22:29:58,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:29:58,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901586450] [2023-11-23 22:29:58,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:58,462 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-23 22:29:58,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:29:58,464 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:58,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:58,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 22:29:58,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:29:58,582 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-23 22:29:58,582 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:29:58,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:29:58,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901586450] [2023-11-23 22:29:58,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901586450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:58,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:58,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:29:58,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935890263] [2023-11-23 22:29:58,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:58,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:58,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:29:58,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:58,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:58,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-23 22:29:58,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:58,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:58,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-23 22:29:58,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:58,739 INFO L124 PetriNetUnfolderBase]: 188/410 cut-off events. [2023-11-23 22:29:58,739 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-23 22:29:58,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 410 events. 188/410 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2229 event pairs, 20 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 759. Up to 277 conditions per place. [2023-11-23 22:29:58,744 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 24 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-23 22:29:58,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 150 flow [2023-11-23 22:29:58,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-23 22:29:58,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7063492063492064 [2023-11-23 22:29:58,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-23 22:29:58,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-23 22:29:58,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:58,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-23 22:29:58,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:58,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:58,749 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:58,749 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 74 flow. Second operand 3 states and 89 transitions. [2023-11-23 22:29:58,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 150 flow [2023-11-23 22:29:58,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:58,751 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2023-11-23 22:29:58,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-11-23 22:29:58,753 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2023-11-23 22:29:58,753 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2023-11-23 22:29:58,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:58,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:58,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:58,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:58,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:58,957 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:58,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:58,958 INFO L85 PathProgramCache]: Analyzing trace with hash 646110645, now seen corresponding path program 1 times [2023-11-23 22:29:58,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:29:58,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014590245] [2023-11-23 22:29:58,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:58,958 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-23 22:29:58,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:29:58,963 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:58,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:59,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 22:29:59,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:29:59,129 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-23 22:29:59,130 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:29:59,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:29:59,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014590245] [2023-11-23 22:29:59,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014590245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:59,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:59,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:29:59,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540878209] [2023-11-23 22:29:59,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:59,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:29:59,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:29:59,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:29:59,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:29:59,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-23 22:29:59,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:59,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:59,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-23 22:29:59,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:59,349 INFO L124 PetriNetUnfolderBase]: 235/506 cut-off events. [2023-11-23 22:29:59,349 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-23 22:29:59,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 506 events. 235/506 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2544 event pairs, 31 based on Foata normal form. 24/527 useless extension candidates. Maximal degree in co-relation 963. Up to 267 conditions per place. [2023-11-23 22:29:59,354 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 33 selfloop transitions, 4 changer transitions 1/49 dead transitions. [2023-11-23 22:29:59,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 188 flow [2023-11-23 22:29:59,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:29:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 22:29:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2023-11-23 22:29:59,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2023-11-23 22:29:59,356 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 108 transitions. [2023-11-23 22:29:59,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 108 transitions. [2023-11-23 22:29:59,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:59,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 108 transitions. [2023-11-23 22:29:59,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:59,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:59,358 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:59,359 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 4 states and 108 transitions. [2023-11-23 22:29:59,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 188 flow [2023-11-23 22:29:59,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:59,361 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 92 flow [2023-11-23 22:29:59,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-11-23 22:29:59,362 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-23 22:29:59,363 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 92 flow [2023-11-23 22:29:59,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:59,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:59,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:59,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:59,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:59,573 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:29:59,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:59,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1564649754, now seen corresponding path program 1 times [2023-11-23 22:29:59,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:29:59,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089982344] [2023-11-23 22:29:59,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:59,575 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-23 22:29:59,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:29:59,579 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:59,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:29:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:59,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 22:29:59,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:29:59,771 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-23 22:29:59,771 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:29:59,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:29:59,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089982344] [2023-11-23 22:29:59,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089982344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:59,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:59,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:29:59,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978954617] [2023-11-23 22:29:59,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:59,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:29:59,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:29:59,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:29:59,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:29:59,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2023-11-23 22:29:59,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:59,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:59,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2023-11-23 22:29:59,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:59,950 INFO L124 PetriNetUnfolderBase]: 105/234 cut-off events. [2023-11-23 22:29:59,951 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-23 22:29:59,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 234 events. 105/234 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 821 event pairs, 21 based on Foata normal form. 16/247 useless extension candidates. Maximal degree in co-relation 523. Up to 86 conditions per place. [2023-11-23 22:29:59,953 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 28 selfloop transitions, 6 changer transitions 1/46 dead transitions. [2023-11-23 22:29:59,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 193 flow [2023-11-23 22:29:59,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 22:29:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-23 22:29:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2023-11-23 22:29:59,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2023-11-23 22:29:59,955 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 122 transitions. [2023-11-23 22:29:59,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 122 transitions. [2023-11-23 22:29:59,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:59,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 122 transitions. [2023-11-23 22:29:59,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:59,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:59,958 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:59,958 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 92 flow. Second operand 5 states and 122 transitions. [2023-11-23 22:29:59,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 193 flow [2023-11-23 22:29:59,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 184 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:59,961 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 108 flow [2023-11-23 22:29:59,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-11-23 22:29:59,962 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2023-11-23 22:29:59,963 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 108 flow [2023-11-23 22:29:59,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:59,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:59,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:59,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:30:00,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:30:00,167 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:30:00,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:30:00,167 INFO L85 PathProgramCache]: Analyzing trace with hash -897465066, now seen corresponding path program 1 times [2023-11-23 22:30:00,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:30:00,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805302612] [2023-11-23 22:30:00,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:30:00,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 22:30:00,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:30:00,172 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:30:00,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:30:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:30:00,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-23 22:30:00,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:30:00,707 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1717~0#1.base_39| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1718~0#1.base_45| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1717~0#1.base_39|)) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1717~0#1.base_39| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1718~0#1.base_45|)) (= (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1717~0#1.base_39| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1718~0#1.base_45| (_ bv0 1)) |c_#valid|))) is different from true [2023-11-23 22:30:00,708 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-23 22:30:00,708 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:30:00,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:30:00,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805302612] [2023-11-23 22:30:00,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805302612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:30:00,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:30:00,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:30:00,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012007134] [2023-11-23 22:30:00,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:30:00,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:30:00,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:30:00,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:30:00,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-23 22:30:00,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2023-11-23 22:30:00,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:00,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:30:00,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2023-11-23 22:30:00,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:30:00,938 INFO L124 PetriNetUnfolderBase]: 64/173 cut-off events. [2023-11-23 22:30:00,939 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-11-23 22:30:00,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 173 events. 64/173 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 603 event pairs, 55 based on Foata normal form. 4/170 useless extension candidates. Maximal degree in co-relation 360. Up to 115 conditions per place. [2023-11-23 22:30:00,941 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 21 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2023-11-23 22:30:00,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 172 flow [2023-11-23 22:30:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 22:30:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-23 22:30:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2023-11-23 22:30:00,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2023-11-23 22:30:00,943 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 92 transitions. [2023-11-23 22:30:00,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 92 transitions. [2023-11-23 22:30:00,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:30:00,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 92 transitions. [2023-11-23 22:30:00,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:00,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:00,945 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:00,945 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 108 flow. Second operand 5 states and 92 transitions. [2023-11-23 22:30:00,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 172 flow [2023-11-23 22:30:00,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 144 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-23 22:30:00,947 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 103 flow [2023-11-23 22:30:00,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2023-11-23 22:30:00,949 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2023-11-23 22:30:00,949 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 103 flow [2023-11-23 22:30:00,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:00,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:30:00,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:30:00,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:30:01,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:30:01,153 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:30:01,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:30:01,153 INFO L85 PathProgramCache]: Analyzing trace with hash -127361791, now seen corresponding path program 1 times [2023-11-23 22:30:01,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:30:01,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293919707] [2023-11-23 22:30:01,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:30:01,154 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-23 22:30:01,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:30:01,155 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:30:01,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:30:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:30:01,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 22:30:01,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:30:01,445 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-23 22:30:01,446 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:30:01,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:30:01,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293919707] [2023-11-23 22:30:01,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293919707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:30:01,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:30:01,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:30:01,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617508636] [2023-11-23 22:30:01,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:30:01,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:30:01,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:30:01,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:30:01,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:30:01,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-23 22:30:01,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 103 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:01,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:30:01,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-23 22:30:01,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:30:01,726 INFO L124 PetriNetUnfolderBase]: 128/324 cut-off events. [2023-11-23 22:30:01,726 INFO L125 PetriNetUnfolderBase]: For 98/102 co-relation queries the response was YES. [2023-11-23 22:30:01,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 324 events. 128/324 cut-off events. For 98/102 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1341 event pairs, 33 based on Foata normal form. 4/320 useless extension candidates. Maximal degree in co-relation 724. Up to 145 conditions per place. [2023-11-23 22:30:01,729 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 40 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-11-23 22:30:01,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 268 flow [2023-11-23 22:30:01,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:30:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 22:30:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2023-11-23 22:30:01,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2023-11-23 22:30:01,732 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 150 transitions. [2023-11-23 22:30:01,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 150 transitions. [2023-11-23 22:30:01,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:30:01,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 150 transitions. [2023-11-23 22:30:01,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:01,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:01,734 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:01,734 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 103 flow. Second operand 6 states and 150 transitions. [2023-11-23 22:30:01,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 268 flow [2023-11-23 22:30:01,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-23 22:30:01,738 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 135 flow [2023-11-23 22:30:01,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-11-23 22:30:01,739 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2023-11-23 22:30:01,739 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 135 flow [2023-11-23 22:30:01,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:01,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:30:01,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, 1, 1, 1, 1] [2023-11-23 22:30:01,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:30:01,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:30:01,943 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:30:01,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:30:01,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1735317725, now seen corresponding path program 2 times [2023-11-23 22:30:01,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:30:01,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495987497] [2023-11-23 22:30:01,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 22:30:01,945 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-23 22:30:01,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:30:01,946 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:30:01,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:30:02,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-23 22:30:02,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 22:30:02,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-23 22:30:02,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:30:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:30:02,379 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:30:02,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:30:02,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495987497] [2023-11-23 22:30:02,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495987497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:30:02,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:30:02,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 22:30:02,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463414562] [2023-11-23 22:30:02,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:30:02,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 22:30:02,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:30:02,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 22:30:02,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:30:02,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-23 22:30:02,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 135 flow. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:02,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:30:02,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-23 22:30:02,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:30:02,710 INFO L124 PetriNetUnfolderBase]: 199/498 cut-off events. [2023-11-23 22:30:02,710 INFO L125 PetriNetUnfolderBase]: For 214/222 co-relation queries the response was YES. [2023-11-23 22:30:02,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 498 events. 199/498 cut-off events. For 214/222 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2489 event pairs, 61 based on Foata normal form. 4/483 useless extension candidates. Maximal degree in co-relation 1226. Up to 196 conditions per place. [2023-11-23 22:30:02,715 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 36 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2023-11-23 22:30:02,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 313 flow [2023-11-23 22:30:02,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:30:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 22:30:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2023-11-23 22:30:02,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5992063492063492 [2023-11-23 22:30:02,718 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 151 transitions. [2023-11-23 22:30:02,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 151 transitions. [2023-11-23 22:30:02,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:30:02,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 151 transitions. [2023-11-23 22:30:02,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:02,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:02,721 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:02,722 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 135 flow. Second operand 6 states and 151 transitions. [2023-11-23 22:30:02,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 313 flow [2023-11-23 22:30:02,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-23 22:30:02,727 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 225 flow [2023-11-23 22:30:02,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-11-23 22:30:02,728 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2023-11-23 22:30:02,728 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 225 flow [2023-11-23 22:30:02,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:02,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:30:02,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:30:02,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:30:02,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:30:02,933 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 22:30:02,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:30:02,934 INFO L85 PathProgramCache]: Analyzing trace with hash -789648887, now seen corresponding path program 3 times [2023-11-23 22:30:02,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:30:02,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924762383] [2023-11-23 22:30:02,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 22:30:02,935 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-23 22:30:02,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:30:02,936 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:30:02,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-23 22:30:03,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-23 22:30:03,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-23 22:30:03,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:30:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:30:03,276 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-23 22:30:03,276 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 22:30:03,278 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-23 22:30:03,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-23 22:30:03,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-23 22:30:03,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-23 22:30:03,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-23 22:30:03,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-23 22:30:03,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-23 22:30:03,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-23 22:30:03,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-23 22:30:03,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-23 22:30:03,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-23 22:30:03,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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-23 22:30:03,486 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:30:03,493 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 22:30:03,493 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 22:30:03,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 22:30:03,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-23 22:30:03,554 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 22:30:03,555 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 22:30:03,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:30:03 BasicIcfg [2023-11-23 22:30:03,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 22:30:03,567 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 22:30:03,567 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 22:30:03,567 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 22:30:03,568 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:55" (3/4) ... [2023-11-23 22:30:03,570 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 22:30:03,571 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 22:30:03,572 INFO L158 Benchmark]: Toolchain (without parser) took 10291.34ms. Allocated memory was 77.6MB in the beginning and 163.6MB in the end (delta: 86.0MB). Free memory was 53.0MB in the beginning and 106.3MB in the end (delta: -53.4MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2023-11-23 22:30:03,572 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 77.6MB. Free memory is still 54.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:30:03,572 INFO L158 Benchmark]: CACSL2BoogieTranslator took 864.68ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 53.0MB in the beginning and 87.1MB in the end (delta: -34.1MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2023-11-23 22:30:03,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.65ms. Allocated memory is still 113.2MB. Free memory was 87.1MB in the beginning and 84.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 22:30:03,573 INFO L158 Benchmark]: Boogie Preprocessor took 42.57ms. Allocated memory is still 113.2MB. Free memory was 84.5MB in the beginning and 82.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 22:30:03,574 INFO L158 Benchmark]: RCFGBuilder took 1060.71ms. Allocated memory is still 113.2MB. Free memory was 81.8MB in the beginning and 54.5MB in the end (delta: 27.4MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2023-11-23 22:30:03,574 INFO L158 Benchmark]: TraceAbstraction took 8210.35ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 53.6MB in the beginning and 106.4MB in the end (delta: -52.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:30:03,574 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 163.6MB. Free memory was 106.4MB in the beginning and 106.3MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 22:30:03,576 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.25ms. Allocated memory is still 77.6MB. Free memory is still 54.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 864.68ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 53.0MB in the beginning and 87.1MB in the end (delta: -34.1MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.65ms. Allocated memory is still 113.2MB. Free memory was 87.1MB in the beginning and 84.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.57ms. Allocated memory is still 113.2MB. Free memory was 84.5MB in the beginning and 82.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1060.71ms. Allocated memory is still 113.2MB. Free memory was 81.8MB in the beginning and 54.5MB in the end (delta: 27.4MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8210.35ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 53.6MB in the beginning and 106.4MB in the end (delta: -52.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 163.6MB. Free memory was 106.4MB in the beginning and 106.3MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1717; [L811] FCALL, FORK 0 pthread_create(&t1717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1717={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L812] 0 pthread_t t1718; [L813] FCALL, FORK 0 pthread_create(&t1718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L758] 2 y$w_buff1 = y$w_buff0 [L759] 2 y$w_buff0 = 2 [L760] 2 y$w_buff1_used = y$w_buff0_used [L761] 2 y$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L763] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L764] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L765] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L766] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EAX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L744] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L745] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L747] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L748] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L826] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 0 y$flush_delayed = weak$$choice2 [L829] 0 y$mem_tmp = y [L830] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L831] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L832] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L833] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L834] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L836] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L838] 0 y = y$flush_delayed ? y$mem_tmp : y [L839] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "rfi007_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 808]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 59 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 274 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 228 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 36 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 651 IncrementalHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 14 mSDtfsCounter, 651 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=10, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 125 ConstructedInterpolants, 1 QuantifiedInterpolants, 946 SizeOfPredicates, 8 NumberOfNonLiveVariables, 967 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-23 22:30:03,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13d37bdb-b366-4a2e-9e87-0c089952118d/bin/uautomizer-verify-zZY32mL2XJ/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