./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya --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 48c4b734419752ee9918164f01e542b34e2482d2668432fb42f6f1192b7f0b6a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:55:39,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:55:39,522 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 01:55:39,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:55:39,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:55:39,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:55:39,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:55:39,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:55:39,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:55:39,561 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:55:39,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:55:39,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:55:39,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:55:39,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:55:39,565 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:55:39,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:55:39,566 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:55:39,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:55:39,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:55:39,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:55:39,568 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:55:39,569 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:55:39,570 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:55:39,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:55:39,571 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:55:39,571 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:55:39,572 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:55:39,572 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:55:39,573 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:55:39,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:55:39,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:55:39,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:55:39,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:55:39,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:55:39,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:55:39,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:55:39,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:55:39,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:55:39,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:55:39,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:55:39,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:55:39,577 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_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 48c4b734419752ee9918164f01e542b34e2482d2668432fb42f6f1192b7f0b6a [2023-11-29 01:55:39,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:55:39,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:55:39,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:55:39,860 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:55:39,861 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:55:39,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-29 01:55:42,780 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:55:43,003 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:55:43,004 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-29 01:55:43,019 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/data/987025b9f/9b45dd55ddb74a5da214e45a4af54fb3/FLAGf28139166 [2023-11-29 01:55:43,033 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/data/987025b9f/9b45dd55ddb74a5da214e45a4af54fb3 [2023-11-29 01:55:43,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:55:43,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:55:43,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:55:43,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:55:43,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:55:43,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:55:43" (1/1) ... [2023-11-29 01:55:43,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd822b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:43, skipping insertion in model container [2023-11-29 01:55:43,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:55:43" (1/1) ... [2023-11-29 01:55:43,098 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:55:43,445 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:55:43,456 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:55:43,506 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:55:43,539 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 01:55:43,539 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 01:55:43,547 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:55:43,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:43 WrapperNode [2023-11-29 01:55:43,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:55:43,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:55:43,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:55:43,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:55:43,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:43" (1/1) ... [2023-11-29 01:55:43,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:43" (1/1) ... [2023-11-29 01:55:43,599 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 117 [2023-11-29 01:55:43,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:55:43,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:55:43,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:55:43,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:55:43,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:43" (1/1) ... [2023-11-29 01:55:43,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:43" (1/1) ... [2023-11-29 01:55:43,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:43" (1/1) ... [2023-11-29 01:55:43,634 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-29 01:55:43,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:43" (1/1) ... [2023-11-29 01:55:43,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:43" (1/1) ... [2023-11-29 01:55:43,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:43" (1/1) ... [2023-11-29 01:55:43,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:43" (1/1) ... [2023-11-29 01:55:43,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:43" (1/1) ... [2023-11-29 01:55:43,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:43" (1/1) ... [2023-11-29 01:55:43,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:55:43,653 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:55:43,653 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:55:43,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:55:43,654 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:43" (1/1) ... [2023-11-29 01:55:43,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:55:43,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:55:43,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:55:43,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:55:43,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:55:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:55:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 01:55:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 01:55:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:55:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:55:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:55:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 01:55:43,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 01:55:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 01:55:43,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 01:55:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:55:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:55:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 01:55:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 01:55:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:55:43,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:55:43,726 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 01:55:43,887 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:55:43,889 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:55:44,111 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:55:44,315 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:55:44,315 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 01:55:44,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:55:44 BoogieIcfgContainer [2023-11-29 01:55:44,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:55:44,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:55:44,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:55:44,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:55:44,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:55:43" (1/3) ... [2023-11-29 01:55:44,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eaad157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:55:44, skipping insertion in model container [2023-11-29 01:55:44,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:43" (2/3) ... [2023-11-29 01:55:44,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eaad157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:55:44, skipping insertion in model container [2023-11-29 01:55:44,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:55:44" (3/3) ... [2023-11-29 01:55:44,325 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-29 01:55:44,345 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:55:44,345 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-29 01:55:44,345 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 01:55:44,389 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 01:55:44,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 92 flow [2023-11-29 01:55:44,454 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-29 01:55:44,455 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:55:44,458 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 63 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-29 01:55:44,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 42 transitions, 92 flow [2023-11-29 01:55:44,462 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 40 transitions, 86 flow [2023-11-29 01:55:44,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:55:44,478 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;@69a05a78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:55:44,478 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-29 01:55:44,480 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 01:55:44,481 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 01:55:44,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:55:44,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:44,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 01:55:44,482 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-29 01:55:44,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:44,486 INFO L85 PathProgramCache]: Analyzing trace with hash 11235, now seen corresponding path program 1 times [2023-11-29 01:55:44,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:55:44,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913978401] [2023-11-29 01:55:44,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:44,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:55:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:44,709 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-29 01:55:44,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:55:44,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913978401] [2023-11-29 01:55:44,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913978401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:55:44,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:55:44,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:55:44,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334604115] [2023-11-29 01:55:44,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:55:44,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:55:44,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:55:44,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:55:44,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:55:44,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-29 01:55:44,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:44,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:55:44,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-29 01:55:44,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:55:44,937 INFO L124 PetriNetUnfolderBase]: 166/408 cut-off events. [2023-11-29 01:55:44,937 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 01:55:44,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 408 events. 166/408 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2517 event pairs, 122 based on Foata normal form. 30/396 useless extension candidates. Maximal degree in co-relation 701. Up to 220 conditions per place. [2023-11-29 01:55:44,944 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 22 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-29 01:55:44,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 138 flow [2023-11-29 01:55:44,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:55:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:55:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2023-11-29 01:55:44,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2023-11-29 01:55:44,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 87 transitions. [2023-11-29 01:55:44,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 87 transitions. [2023-11-29 01:55:44,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:55:44,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 87 transitions. [2023-11-29 01:55:44,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:44,966 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-29 01:55:44,967 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-29 01:55:44,969 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 86 flow. Second operand 3 states and 87 transitions. [2023-11-29 01:55:44,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 138 flow [2023-11-29 01:55:44,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:55:44,974 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-29 01:55:44,976 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-29 01:55:44,980 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-29 01:55:44,980 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-29 01:55:44,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:44,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:44,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 01:55:44,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:55:44,981 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-29 01:55:44,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:44,982 INFO L85 PathProgramCache]: Analyzing trace with hash 11236, now seen corresponding path program 1 times [2023-11-29 01:55:44,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:55:44,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346704489] [2023-11-29 01:55:44,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:44,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:55:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:45,085 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-29 01:55:45,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:55:45,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346704489] [2023-11-29 01:55:45,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346704489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:55:45,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:55:45,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:55:45,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488272229] [2023-11-29 01:55:45,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:55:45,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:55:45,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:55:45,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:55:45,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:55:45,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2023-11-29 01:55:45,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 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-29 01:55:45,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:55:45,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2023-11-29 01:55:45,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:55:45,227 INFO L124 PetriNetUnfolderBase]: 166/407 cut-off events. [2023-11-29 01:55:45,227 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-29 01:55:45,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 407 events. 166/407 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2523 event pairs, 122 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 716. Up to 219 conditions per place. [2023-11-29 01:55:45,233 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 21 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-29 01:55:45,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 136 flow [2023-11-29 01:55:45,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:55:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:55:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2023-11-29 01:55:45,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2023-11-29 01:55:45,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 87 transitions. [2023-11-29 01:55:45,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 87 transitions. [2023-11-29 01:55:45,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:55:45,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 87 transitions. [2023-11-29 01:55:45,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:45,237 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-29 01:55:45,238 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-29 01:55:45,238 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 87 transitions. [2023-11-29 01:55:45,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 136 flow [2023-11-29 01:55:45,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:55:45,241 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-29 01:55:45,241 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-29 01:55:45,242 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-29 01:55:45,242 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-29 01:55:45,242 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-29 01:55:45,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:45,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:55:45,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:55:45,243 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-29 01:55:45,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:45,244 INFO L85 PathProgramCache]: Analyzing trace with hash 335010566, now seen corresponding path program 1 times [2023-11-29 01:55:45,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:55:45,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477548293] [2023-11-29 01:55:45,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:45,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:55:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:45,307 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-29 01:55:45,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:55:45,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477548293] [2023-11-29 01:55:45,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477548293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:55:45,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:55:45,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:55:45,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270920715] [2023-11-29 01:55:45,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:55:45,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:55:45,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:55:45,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:55:45,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:55:45,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-29 01:55:45,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:45,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:55:45,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-29 01:55:45,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:55:45,429 INFO L124 PetriNetUnfolderBase]: 168/401 cut-off events. [2023-11-29 01:55:45,430 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-29 01:55:45,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 401 events. 168/401 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2447 event pairs, 127 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 715. Up to 220 conditions per place. [2023-11-29 01:55:45,434 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 22 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-11-29 01:55:45,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 136 flow [2023-11-29 01:55:45,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:55:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:55:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2023-11-29 01:55:45,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6746031746031746 [2023-11-29 01:55:45,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 85 transitions. [2023-11-29 01:55:45,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 85 transitions. [2023-11-29 01:55:45,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:55:45,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 85 transitions. [2023-11-29 01:55:45,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:45,439 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-29 01:55:45,440 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-29 01:55:45,440 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 85 transitions. [2023-11-29 01:55:45,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 136 flow [2023-11-29 01:55:45,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:55:45,443 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-29 01:55:45,443 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-29 01:55:45,444 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-29 01:55:45,444 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-29 01:55:45,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:45,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:45,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:55:45,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:55:45,445 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-29 01:55:45,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:45,446 INFO L85 PathProgramCache]: Analyzing trace with hash 335010567, now seen corresponding path program 1 times [2023-11-29 01:55:45,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:55:45,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653577326] [2023-11-29 01:55:45,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:45,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:55:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:55:45,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:55:45,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653577326] [2023-11-29 01:55:45,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653577326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:55:45,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:55:45,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:55:45,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885004789] [2023-11-29 01:55:45,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:55:45,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:55:45,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:55:45,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:55:45,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:55:45,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2023-11-29 01:55:45,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:45,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:55:45,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2023-11-29 01:55:45,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:55:45,696 INFO L124 PetriNetUnfolderBase]: 166/401 cut-off events. [2023-11-29 01:55:45,696 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-29 01:55:45,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 401 events. 166/401 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2460 event pairs, 80 based on Foata normal form. 3/370 useless extension candidates. Maximal degree in co-relation 713. Up to 215 conditions per place. [2023-11-29 01:55:45,702 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 21 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-11-29 01:55:45,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 132 flow [2023-11-29 01:55:45,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:55:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:55:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2023-11-29 01:55:45,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2023-11-29 01:55:45,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 87 transitions. [2023-11-29 01:55:45,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 87 transitions. [2023-11-29 01:55:45,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:55:45,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 87 transitions. [2023-11-29 01:55:45,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:45,707 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-29 01:55:45,707 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-29 01:55:45,707 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 87 transitions. [2023-11-29 01:55:45,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 132 flow [2023-11-29 01:55:45,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:55:45,710 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 74 flow [2023-11-29 01:55:45,710 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-29 01:55:45,711 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-11-29 01:55:45,712 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 74 flow [2023-11-29 01:55:45,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:45,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:45,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:55:45,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:55:45,713 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-29 01:55:45,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1203916624, now seen corresponding path program 1 times [2023-11-29 01:55:45,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:55:45,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140800313] [2023-11-29 01:55:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:55:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:55:45,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:55:45,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140800313] [2023-11-29 01:55:45,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140800313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:55:45,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:55:45,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:55:45,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611570438] [2023-11-29 01:55:45,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:55:45,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:55:45,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:55:45,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:55:45,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:55:45,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 42 [2023-11-29 01:55:45,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:45,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:55:45,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 42 [2023-11-29 01:55:45,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:55:46,006 INFO L124 PetriNetUnfolderBase]: 129/310 cut-off events. [2023-11-29 01:55:46,007 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-29 01:55:46,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 310 events. 129/310 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1655 event pairs, 18 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 558. Up to 184 conditions per place. [2023-11-29 01:55:46,010 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 21 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-11-29 01:55:46,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 142 flow [2023-11-29 01:55:46,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:55:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:55:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2023-11-29 01:55:46,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7301587301587301 [2023-11-29 01:55:46,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 92 transitions. [2023-11-29 01:55:46,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 92 transitions. [2023-11-29 01:55:46,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:55:46,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 92 transitions. [2023-11-29 01:55:46,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 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-29 01:55:46,014 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-29 01:55:46,015 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-29 01:55:46,015 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 74 flow. Second operand 3 states and 92 transitions. [2023-11-29 01:55:46,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 142 flow [2023-11-29 01:55:46,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:55:46,017 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2023-11-29 01:55:46,017 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-29 01:55:46,018 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2023-11-29 01:55:46,018 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2023-11-29 01:55:46,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:46,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:46,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:55:46,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:55:46,019 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-29 01:55:46,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:46,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1487630472, now seen corresponding path program 1 times [2023-11-29 01:55:46,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:55:46,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370844315] [2023-11-29 01:55:46,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:46,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:55:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:46,263 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-29 01:55:46,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:55:46,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370844315] [2023-11-29 01:55:46,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370844315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:55:46,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:55:46,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:55:46,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508823675] [2023-11-29 01:55:46,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:55:46,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:55:46,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:55:46,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:55:46,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:55:46,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-29 01:55:46,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:46,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:55:46,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-29 01:55:46,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:55:46,436 INFO L124 PetriNetUnfolderBase]: 112/281 cut-off events. [2023-11-29 01:55:46,437 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-29 01:55:46,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 281 events. 112/281 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1591 event pairs, 93 based on Foata normal form. 12/282 useless extension candidates. Maximal degree in co-relation 506. Up to 170 conditions per place. [2023-11-29 01:55:46,439 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 15 selfloop transitions, 2 changer transitions 6/37 dead transitions. [2023-11-29 01:55:46,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 130 flow [2023-11-29 01:55:46,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:55:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:55:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2023-11-29 01:55:46,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2023-11-29 01:55:46,441 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 119 transitions. [2023-11-29 01:55:46,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 119 transitions. [2023-11-29 01:55:46,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:55:46,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 119 transitions. [2023-11-29 01:55:46,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:46,444 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-29 01:55:46,444 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-29 01:55:46,444 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 5 states and 119 transitions. [2023-11-29 01:55:46,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 130 flow [2023-11-29 01:55:46,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:55:46,446 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-11-29 01:55:46,446 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-29 01:55:46,447 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2023-11-29 01:55:46,447 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-11-29 01:55:46,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:46,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:46,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:55:46,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:55:46,448 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-29 01:55:46,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:46,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1487630455, now seen corresponding path program 1 times [2023-11-29 01:55:46,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:55:46,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799185544] [2023-11-29 01:55:46,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:46,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:55:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:46,661 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-29 01:55:46,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:55:46,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799185544] [2023-11-29 01:55:46,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799185544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:55:46,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:55:46,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:55:46,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487496637] [2023-11-29 01:55:46,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:55:46,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:55:46,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:55:46,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:55:46,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:55:46,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2023-11-29 01:55:46,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 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-29 01:55:46,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:55:46,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2023-11-29 01:55:46,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:55:47,141 INFO L124 PetriNetUnfolderBase]: 682/1301 cut-off events. [2023-11-29 01:55:47,141 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 01:55:47,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2497 conditions, 1301 events. 682/1301 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7831 event pairs, 57 based on Foata normal form. 0/1259 useless extension candidates. Maximal degree in co-relation 2486. Up to 423 conditions per place. [2023-11-29 01:55:47,149 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 33 selfloop transitions, 5 changer transitions 60/107 dead transitions. [2023-11-29 01:55:47,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 107 transitions, 422 flow [2023-11-29 01:55:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:55:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 01:55:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 293 transitions. [2023-11-29 01:55:47,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5813492063492064 [2023-11-29 01:55:47,151 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 293 transitions. [2023-11-29 01:55:47,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 293 transitions. [2023-11-29 01:55:47,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:55:47,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 293 transitions. [2023-11-29 01:55:47,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 24.416666666666668) internal successors, (293), 12 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:47,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 42.0) internal successors, (546), 13 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:47,155 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 42.0) internal successors, (546), 13 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:47,156 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 12 states and 293 transitions. [2023-11-29 01:55:47,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 107 transitions, 422 flow [2023-11-29 01:55:47,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 107 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:55:47,158 INFO L231 Difference]: Finished difference. Result has 54 places, 30 transitions, 97 flow [2023-11-29 01:55:47,159 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=97, PETRI_PLACES=54, PETRI_TRANSITIONS=30} [2023-11-29 01:55:47,159 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2023-11-29 01:55:47,159 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 30 transitions, 97 flow [2023-11-29 01:55:47,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 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-29 01:55:47,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:47,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:55:47,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:55:47,160 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-29 01:55:47,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:47,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1697312330, now seen corresponding path program 1 times [2023-11-29 01:55:47,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:55:47,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746229201] [2023-11-29 01:55:47,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:47,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:55:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:47,314 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-29 01:55:47,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:55:47,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746229201] [2023-11-29 01:55:47,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746229201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:55:47,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:55:47,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:55:47,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701031991] [2023-11-29 01:55:47,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:55:47,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:55:47,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:55:47,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:55:47,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:55:47,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-29 01:55:47,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 30 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:47,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:55:47,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-29 01:55:47,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:55:47,473 INFO L124 PetriNetUnfolderBase]: 277/596 cut-off events. [2023-11-29 01:55:47,473 INFO L125 PetriNetUnfolderBase]: For 231/231 co-relation queries the response was YES. [2023-11-29 01:55:47,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 596 events. 277/596 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3207 event pairs, 51 based on Foata normal form. 35/617 useless extension candidates. Maximal degree in co-relation 1296. Up to 295 conditions per place. [2023-11-29 01:55:47,478 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 28 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2023-11-29 01:55:47,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 198 flow [2023-11-29 01:55:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:55:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 01:55:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2023-11-29 01:55:47,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2023-11-29 01:55:47,480 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 111 transitions. [2023-11-29 01:55:47,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 111 transitions. [2023-11-29 01:55:47,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:55:47,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 111 transitions. [2023-11-29 01:55:47,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:47,481 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-29 01:55:47,481 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-29 01:55:47,481 INFO L175 Difference]: Start difference. First operand has 54 places, 30 transitions, 97 flow. Second operand 4 states and 111 transitions. [2023-11-29 01:55:47,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 198 flow [2023-11-29 01:55:47,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 181 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-11-29 01:55:47,487 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 106 flow [2023-11-29 01:55:47,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-11-29 01:55:47,488 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-29 01:55:47,488 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 106 flow [2023-11-29 01:55:47,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:47,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:47,488 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-29 01:55:47,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:55:47,489 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-29 01:55:47,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:47,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1653724390, now seen corresponding path program 1 times [2023-11-29 01:55:47,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:55:47,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231991637] [2023-11-29 01:55:47,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:47,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:55:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:55:47,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:55:47,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231991637] [2023-11-29 01:55:47,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231991637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:55:47,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:55:47,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:55:47,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655084678] [2023-11-29 01:55:47,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:55:47,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:55:47,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:55:47,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:55:47,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:55:47,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-29 01:55:47,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 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-29 01:55:47,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:55:47,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-29 01:55:47,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:55:47,799 INFO L124 PetriNetUnfolderBase]: 141/305 cut-off events. [2023-11-29 01:55:47,799 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2023-11-29 01:55:47,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 305 events. 141/305 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1242 event pairs, 25 based on Foata normal form. 26/319 useless extension candidates. Maximal degree in co-relation 732. Up to 119 conditions per place. [2023-11-29 01:55:47,801 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 21 selfloop transitions, 6 changer transitions 5/44 dead transitions. [2023-11-29 01:55:47,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 198 flow [2023-11-29 01:55:47,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:55:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:55:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2023-11-29 01:55:47,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2023-11-29 01:55:47,803 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 128 transitions. [2023-11-29 01:55:47,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 128 transitions. [2023-11-29 01:55:47,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:55:47,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 128 transitions. [2023-11-29 01:55:47,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:47,804 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-29 01:55:47,805 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-29 01:55:47,805 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 106 flow. Second operand 5 states and 128 transitions. [2023-11-29 01:55:47,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 198 flow [2023-11-29 01:55:47,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 189 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 01:55:47,807 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 117 flow [2023-11-29 01:55:47,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2023-11-29 01:55:47,808 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-11-29 01:55:47,809 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 117 flow [2023-11-29 01:55:47,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 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-29 01:55:47,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:47,809 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-29 01:55:47,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:55:47,809 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-29 01:55:47,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:47,810 INFO L85 PathProgramCache]: Analyzing trace with hash 306128134, now seen corresponding path program 1 times [2023-11-29 01:55:47,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:55:47,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267447052] [2023-11-29 01:55:47,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:47,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:55:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:55:47,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:55:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:55:47,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:55:47,954 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:55:47,956 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-29 01:55:47,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-29 01:55:47,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-29 01:55:47,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-29 01:55:47,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-29 01:55:47,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-29 01:55:47,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-29 01:55:47,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-29 01:55:47,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-29 01:55:47,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-29 01:55:47,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:55:47,960 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:55:47,968 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 01:55:47,969 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:55:48,013 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 01:55:48,014 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 01:55:48,022 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 01:55:48,023 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 01:55:48,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:55:48 BasicIcfg [2023-11-29 01:55:48,034 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:55:48,035 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:55:48,035 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:55:48,035 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:55:48,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:55:44" (3/4) ... [2023-11-29 01:55:48,037 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 01:55:48,038 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:55:48,039 INFO L158 Benchmark]: Toolchain (without parser) took 5003.16ms. Allocated memory was 157.3MB in the beginning and 247.5MB in the end (delta: 90.2MB). Free memory was 116.1MB in the beginning and 198.9MB in the end (delta: -82.8MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2023-11-29 01:55:48,039 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 157.3MB. Free memory is still 131.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:55:48,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.95ms. Allocated memory is still 157.3MB. Free memory was 115.6MB in the beginning and 93.0MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 01:55:48,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.42ms. Allocated memory is still 157.3MB. Free memory was 93.0MB in the beginning and 90.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:55:48,041 INFO L158 Benchmark]: Boogie Preprocessor took 51.93ms. Allocated memory is still 157.3MB. Free memory was 90.9MB in the beginning and 87.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:55:48,041 INFO L158 Benchmark]: RCFGBuilder took 662.52ms. Allocated memory was 157.3MB in the beginning and 205.5MB in the end (delta: 48.2MB). Free memory was 87.7MB in the beginning and 159.0MB in the end (delta: -71.3MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2023-11-29 01:55:48,041 INFO L158 Benchmark]: TraceAbstraction took 3715.35ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 157.9MB in the beginning and 198.9MB in the end (delta: -41.0MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. [2023-11-29 01:55:48,042 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 247.5MB. Free memory is still 198.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:55:48,044 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.23ms. Allocated memory is still 157.3MB. Free memory is still 131.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.95ms. Allocated memory is still 157.3MB. Free memory was 115.6MB in the beginning and 93.0MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.42ms. Allocated memory is still 157.3MB. Free memory was 93.0MB in the beginning and 90.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.93ms. Allocated memory is still 157.3MB. Free memory was 90.9MB in the beginning and 87.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 662.52ms. Allocated memory was 157.3MB in the beginning and 205.5MB in the end (delta: 48.2MB). Free memory was 87.7MB in the beginning and 159.0MB in the end (delta: -71.3MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3715.35ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 157.9MB in the beginning and 198.9MB in the end (delta: -41.0MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 247.5MB. Free memory is still 198.9MB. 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L803] 0 pthread_t t2561; [L804] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2561={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L805] 0 pthread_t t2562; [L806] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2561={5:0}, t2562={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 1 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L778] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L737] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 x$flush_delayed = weak$$choice2 [L745] 1 x$mem_tmp = x [L746] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L747] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L748] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L749] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L750] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L752] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EAX = x [L754] 1 x = x$flush_delayed ? x$mem_tmp : x [L755] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L781] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561={5:0}, t2562={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L810] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L810] RET 0 assume_abort_if_not(main$tmp_guard0) [L812] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L813] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L814] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L815] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L816] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561={5:0}, t2562={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561={5:0}, t2562={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 __assert_fail ("0", "safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: 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: 801]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 804]: 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: 806]: 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: 3.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 291 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 232 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 567 IncrementalHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 32 mSDtfsCounter, 567 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=9, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 412 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 01:55:48,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya --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 48c4b734419752ee9918164f01e542b34e2482d2668432fb42f6f1192b7f0b6a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:55:50,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:55:50,398 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 01:55:50,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:55:50,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:55:50,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:55:50,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:55:50,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:55:50,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:55:50,435 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:55:50,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:55:50,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:55:50,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:55:50,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:55:50,438 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:55:50,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:55:50,439 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:55:50,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:55:50,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:55:50,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:55:50,442 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:55:50,443 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:55:50,443 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:55:50,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:55:50,444 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:55:50,445 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:55:50,445 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:55:50,446 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:55:50,446 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:55:50,447 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:55:50,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:55:50,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:55:50,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:55:50,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:55:50,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:55:50,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:55:50,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:55:50,449 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:55:50,450 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:55:50,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:55:50,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:55:50,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:55:50,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:55:50,451 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:55:50,451 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_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 48c4b734419752ee9918164f01e542b34e2482d2668432fb42f6f1192b7f0b6a [2023-11-29 01:55:50,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:55:50,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:55:50,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:55:50,875 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:55:50,876 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:55:50,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-29 01:55:54,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:55:54,408 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:55:54,408 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-29 01:55:54,429 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/data/6deaad0d4/9dc886524ef8455daa62f4c676e9f831/FLAGdab44657e [2023-11-29 01:55:54,445 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/data/6deaad0d4/9dc886524ef8455daa62f4c676e9f831 [2023-11-29 01:55:54,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:55:54,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:55:54,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:55:54,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:55:54,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:55:54,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:55:54" (1/1) ... [2023-11-29 01:55:54,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b44ce25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:54, skipping insertion in model container [2023-11-29 01:55:54,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:55:54" (1/1) ... [2023-11-29 01:55:54,518 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:55:54,940 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:55:54,980 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:55:55,047 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:55:55,097 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 01:55:55,098 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 01:55:55,107 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:55:55,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:55 WrapperNode [2023-11-29 01:55:55,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:55:55,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:55:55,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:55:55,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:55:55,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:55" (1/1) ... [2023-11-29 01:55:55,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:55" (1/1) ... [2023-11-29 01:55:55,176 INFO L138 Inliner]: procedures = 178, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 118 [2023-11-29 01:55:55,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:55:55,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:55:55,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:55:55,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:55:55,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:55" (1/1) ... [2023-11-29 01:55:55,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:55" (1/1) ... [2023-11-29 01:55:55,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:55" (1/1) ... [2023-11-29 01:55:55,219 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-29 01:55:55,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:55" (1/1) ... [2023-11-29 01:55:55,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:55" (1/1) ... [2023-11-29 01:55:55,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:55" (1/1) ... [2023-11-29 01:55:55,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:55" (1/1) ... [2023-11-29 01:55:55,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:55" (1/1) ... [2023-11-29 01:55:55,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:55" (1/1) ... [2023-11-29 01:55:55,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:55:55,247 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:55:55,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:55:55,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:55:55,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:55" (1/1) ... [2023-11-29 01:55:55,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:55:55,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:55:55,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:55:55,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:55:55,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 01:55:55,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:55:55,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:55:55,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:55:55,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 01:55:55,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 01:55:55,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 01:55:55,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:55:55,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 01:55:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 01:55:55,336 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 01:55:55,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 01:55:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 01:55:55,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 01:55:55,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 01:55:55,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:55:55,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:55:55,340 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 01:55:55,527 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:55:55,530 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:55:55,871 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:55:56,114 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:55:56,114 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 01:55:56,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:55:56 BoogieIcfgContainer [2023-11-29 01:55:56,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:55:56,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:55:56,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:55:56,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:55:56,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:55:54" (1/3) ... [2023-11-29 01:55:56,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c49b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:55:56, skipping insertion in model container [2023-11-29 01:55:56,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:55:55" (2/3) ... [2023-11-29 01:55:56,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c49b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:55:56, skipping insertion in model container [2023-11-29 01:55:56,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:55:56" (3/3) ... [2023-11-29 01:55:56,124 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-29 01:55:56,141 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:55:56,142 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-29 01:55:56,142 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 01:55:56,202 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 01:55:56,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 92 flow [2023-11-29 01:55:56,268 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-29 01:55:56,269 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:55:56,273 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 63 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-29 01:55:56,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 42 transitions, 92 flow [2023-11-29 01:55:56,277 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 40 transitions, 86 flow [2023-11-29 01:55:56,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:55:56,296 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;@656e5ed0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:55:56,296 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-29 01:55:56,300 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 01:55:56,300 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 01:55:56,300 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:55:56,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:56,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 01:55:56,301 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-29 01:55:56,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:56,307 INFO L85 PathProgramCache]: Analyzing trace with hash 11299, now seen corresponding path program 1 times [2023-11-29 01:55:56,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:55:56,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144801901] [2023-11-29 01:55:56,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:56,322 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-29 01:55:56,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:55:56,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:56,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:56,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:55:56,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:55:56,472 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-29 01:55:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:55:56,487 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:55:56,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:55:56,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144801901] [2023-11-29 01:55:56,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144801901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:55:56,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:55:56,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:55:56,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155534368] [2023-11-29 01:55:56,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:55:56,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:55:56,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:55:56,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:55:56,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:55:56,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-29 01:55:56,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:56,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:55:56,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-29 01:55:56,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:55:56,767 INFO L124 PetriNetUnfolderBase]: 166/408 cut-off events. [2023-11-29 01:55:56,767 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 01:55:56,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 408 events. 166/408 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2517 event pairs, 122 based on Foata normal form. 30/396 useless extension candidates. Maximal degree in co-relation 701. Up to 220 conditions per place. [2023-11-29 01:55:56,774 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 22 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-29 01:55:56,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 138 flow [2023-11-29 01:55:56,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:55:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:55:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2023-11-29 01:55:56,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2023-11-29 01:55:56,788 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 87 transitions. [2023-11-29 01:55:56,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 87 transitions. [2023-11-29 01:55:56,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:55:56,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 87 transitions. [2023-11-29 01:55:56,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:56,797 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-29 01:55:56,798 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-29 01:55:56,800 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 86 flow. Second operand 3 states and 87 transitions. [2023-11-29 01:55:56,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 138 flow [2023-11-29 01:55:56,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:55:56,805 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-29 01:55:56,808 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-29 01:55:56,811 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-29 01:55:56,812 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-29 01:55:56,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:56,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:56,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 01:55:56,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:57,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:57,013 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-29 01:55:57,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash 11300, now seen corresponding path program 1 times [2023-11-29 01:55:57,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:55:57,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34381104] [2023-11-29 01:55:57,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:57,015 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-29 01:55:57,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:55:57,017 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:57,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:57,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:55:57,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:55:57,121 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-29 01:55:57,137 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-29 01:55:57,137 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:55:57,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:55:57,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34381104] [2023-11-29 01:55:57,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34381104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:55:57,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:55:57,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:55:57,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884435059] [2023-11-29 01:55:57,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:55:57,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:55:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:55:57,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:55:57,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:55:57,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2023-11-29 01:55:57,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 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-29 01:55:57,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:55:57,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2023-11-29 01:55:57,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:55:57,345 INFO L124 PetriNetUnfolderBase]: 166/407 cut-off events. [2023-11-29 01:55:57,345 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-29 01:55:57,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 407 events. 166/407 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2523 event pairs, 122 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 716. Up to 219 conditions per place. [2023-11-29 01:55:57,352 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 21 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-29 01:55:57,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 136 flow [2023-11-29 01:55:57,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:55:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:55:57,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2023-11-29 01:55:57,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2023-11-29 01:55:57,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 87 transitions. [2023-11-29 01:55:57,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 87 transitions. [2023-11-29 01:55:57,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:55:57,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 87 transitions. [2023-11-29 01:55:57,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:57,358 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-29 01:55:57,359 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-29 01:55:57,359 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 87 transitions. [2023-11-29 01:55:57,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 136 flow [2023-11-29 01:55:57,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:55:57,363 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-29 01:55:57,363 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-29 01:55:57,364 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-11-29 01:55:57,364 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-29 01:55:57,365 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-29 01:55:57,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:57,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:55:57,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:57,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:57,566 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-29 01:55:57,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:57,567 INFO L85 PathProgramCache]: Analyzing trace with hash 336919176, now seen corresponding path program 1 times [2023-11-29 01:55:57,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:55:57,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527923950] [2023-11-29 01:55:57,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:57,568 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-29 01:55:57,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:55:57,570 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:57,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:57,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:55:57,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:55:57,683 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-29 01:55:57,691 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-29 01:55:57,691 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:55:57,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:55:57,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527923950] [2023-11-29 01:55:57,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527923950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:55:57,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:55:57,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:55:57,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35071689] [2023-11-29 01:55:57,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:55:57,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:55:57,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:55:57,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:55:57,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:55:57,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2023-11-29 01:55:57,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:57,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:55:57,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2023-11-29 01:55:57,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:55:57,856 INFO L124 PetriNetUnfolderBase]: 168/401 cut-off events. [2023-11-29 01:55:57,856 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-29 01:55:57,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 401 events. 168/401 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2447 event pairs, 127 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 715. Up to 220 conditions per place. [2023-11-29 01:55:57,861 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 22 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-11-29 01:55:57,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 136 flow [2023-11-29 01:55:57,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:55:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:55:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2023-11-29 01:55:57,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6746031746031746 [2023-11-29 01:55:57,863 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 85 transitions. [2023-11-29 01:55:57,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 85 transitions. [2023-11-29 01:55:57,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:55:57,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 85 transitions. [2023-11-29 01:55:57,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:57,867 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-29 01:55:57,867 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-29 01:55:57,867 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 85 transitions. [2023-11-29 01:55:57,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 136 flow [2023-11-29 01:55:57,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:55:57,870 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-29 01:55:57,870 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-29 01:55:57,871 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-29 01:55:57,872 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-29 01:55:57,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:57,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:57,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:55:57,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 01:55:58,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:58,074 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-29 01:55:58,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash 336919177, now seen corresponding path program 1 times [2023-11-29 01:55:58,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:55:58,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063515866] [2023-11-29 01:55:58,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:58,076 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-29 01:55:58,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:55:58,078 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:58,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:58,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:55:58,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:55:58,175 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-29 01:55:58,190 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-29 01:55:58,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:55:58,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:55:58,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063515866] [2023-11-29 01:55:58,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063515866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:55:58,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:55:58,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:55:58,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046772367] [2023-11-29 01:55:58,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:55:58,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:55:58,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:55:58,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:55:58,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:55:58,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2023-11-29 01:55:58,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:58,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:55:58,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2023-11-29 01:55:58,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:55:58,368 INFO L124 PetriNetUnfolderBase]: 166/401 cut-off events. [2023-11-29 01:55:58,368 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-29 01:55:58,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 401 events. 166/401 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2460 event pairs, 80 based on Foata normal form. 3/370 useless extension candidates. Maximal degree in co-relation 713. Up to 215 conditions per place. [2023-11-29 01:55:58,373 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 21 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-11-29 01:55:58,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 132 flow [2023-11-29 01:55:58,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:55:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:55:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2023-11-29 01:55:58,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2023-11-29 01:55:58,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 87 transitions. [2023-11-29 01:55:58,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 87 transitions. [2023-11-29 01:55:58,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:55:58,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 87 transitions. [2023-11-29 01:55:58,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:58,377 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-29 01:55:58,378 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-29 01:55:58,378 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 87 transitions. [2023-11-29 01:55:58,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 132 flow [2023-11-29 01:55:58,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:55:58,381 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 74 flow [2023-11-29 01:55:58,381 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-29 01:55:58,382 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-11-29 01:55:58,382 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 74 flow [2023-11-29 01:55:58,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:58,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:58,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:55:58,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 01:55:58,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:58,584 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-29 01:55:58,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:58,585 INFO L85 PathProgramCache]: Analyzing trace with hash -179088976, now seen corresponding path program 1 times [2023-11-29 01:55:58,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:55:58,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472456028] [2023-11-29 01:55:58,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:58,586 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-29 01:55:58,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:55:58,587 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:58,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:58,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:55:58,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:55:58,718 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-29 01:55:58,718 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:55:58,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:55:58,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472456028] [2023-11-29 01:55:58,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472456028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:55:58,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:55:58,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:55:58,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854686046] [2023-11-29 01:55:58,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:55:58,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:55:58,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:55:58,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:55:58,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:55:58,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 42 [2023-11-29 01:55:58,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:58,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:55:58,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 42 [2023-11-29 01:55:58,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:55:58,847 INFO L124 PetriNetUnfolderBase]: 129/310 cut-off events. [2023-11-29 01:55:58,847 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-29 01:55:58,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 310 events. 129/310 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1655 event pairs, 18 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 558. Up to 184 conditions per place. [2023-11-29 01:55:58,851 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 21 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-11-29 01:55:58,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 142 flow [2023-11-29 01:55:58,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:55:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:55:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2023-11-29 01:55:58,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7301587301587301 [2023-11-29 01:55:58,854 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 92 transitions. [2023-11-29 01:55:58,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 92 transitions. [2023-11-29 01:55:58,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:55:58,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 92 transitions. [2023-11-29 01:55:58,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 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-29 01:55:58,856 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-29 01:55:58,857 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-29 01:55:58,857 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 74 flow. Second operand 3 states and 92 transitions. [2023-11-29 01:55:58,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 142 flow [2023-11-29 01:55:58,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:55:58,859 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2023-11-29 01:55:58,859 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-29 01:55:58,860 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2023-11-29 01:55:58,860 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2023-11-29 01:55:58,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:58,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:58,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:55:58,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 01:55:59,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:59,064 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-29 01:55:59,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:59,065 INFO L85 PathProgramCache]: Analyzing trace with hash 880932554, now seen corresponding path program 1 times [2023-11-29 01:55:59,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:55:59,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973050615] [2023-11-29 01:55:59,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:59,066 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-29 01:55:59,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:55:59,067 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:59,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:59,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:55:59,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:55:59,197 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-29 01:55:59,197 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:55:59,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:55:59,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973050615] [2023-11-29 01:55:59,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973050615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:55:59,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:55:59,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:55:59,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412964262] [2023-11-29 01:55:59,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:55:59,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:55:59,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:55:59,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:55:59,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:55:59,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-29 01:55:59,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:59,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:55:59,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-29 01:55:59,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:55:59,373 INFO L124 PetriNetUnfolderBase]: 180/414 cut-off events. [2023-11-29 01:55:59,374 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-29 01:55:59,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 414 events. 180/414 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2133 event pairs, 24 based on Foata normal form. 20/427 useless extension candidates. Maximal degree in co-relation 774. Up to 199 conditions per place. [2023-11-29 01:55:59,378 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 29 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2023-11-29 01:55:59,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 176 flow [2023-11-29 01:55:59,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:55:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 01:55:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2023-11-29 01:55:59,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 01:55:59,380 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 112 transitions. [2023-11-29 01:55:59,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 112 transitions. [2023-11-29 01:55:59,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:55:59,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 112 transitions. [2023-11-29 01:55:59,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.0) internal successors, (112), 4 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-29 01:55:59,383 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-29 01:55:59,383 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-29 01:55:59,384 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 4 states and 112 transitions. [2023-11-29 01:55:59,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 176 flow [2023-11-29 01:55:59,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:55:59,386 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 92 flow [2023-11-29 01:55:59,387 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-29 01:55:59,388 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-11-29 01:55:59,388 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 92 flow [2023-11-29 01:55:59,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:59,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:59,389 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-29 01:55:59,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 01:55:59,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:59,592 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-29 01:55:59,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:59,593 INFO L85 PathProgramCache]: Analyzing trace with hash -708277932, now seen corresponding path program 1 times [2023-11-29 01:55:59,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:55:59,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520682215] [2023-11-29 01:55:59,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:59,594 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-29 01:55:59,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:55:59,595 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:59,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:55:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:59,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:55:59,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:55:59,773 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-29 01:55:59,773 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:55:59,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:55:59,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520682215] [2023-11-29 01:55:59,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520682215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:55:59,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:55:59,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:55:59,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915346085] [2023-11-29 01:55:59,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:55:59,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:55:59,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:55:59,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:55:59,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:55:59,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-29 01:55:59,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 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-29 01:55:59,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:55:59,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-29 01:55:59,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:55:59,930 INFO L124 PetriNetUnfolderBase]: 88/206 cut-off events. [2023-11-29 01:55:59,931 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-29 01:55:59,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 206 events. 88/206 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 730 event pairs, 16 based on Foata normal form. 14/213 useless extension candidates. Maximal degree in co-relation 456. Up to 71 conditions per place. [2023-11-29 01:55:59,933 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 25 selfloop transitions, 6 changer transitions 1/45 dead transitions. [2023-11-29 01:55:59,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 185 flow [2023-11-29 01:55:59,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:55:59,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:55:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2023-11-29 01:55:59,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2023-11-29 01:55:59,935 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 129 transitions. [2023-11-29 01:55:59,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 129 transitions. [2023-11-29 01:55:59,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:55:59,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 129 transitions. [2023-11-29 01:55:59,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:55:59,937 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-29 01:55:59,938 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-29 01:55:59,938 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 92 flow. Second operand 5 states and 129 transitions. [2023-11-29 01:55:59,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 185 flow [2023-11-29 01:55:59,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 176 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 01:55:59,940 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 108 flow [2023-11-29 01:55:59,941 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-29 01:55:59,942 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2023-11-29 01:55:59,942 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 108 flow [2023-11-29 01:55:59,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 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-29 01:55:59,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:55:59,942 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-29 01:55:59,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 01:56:00,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:56:00,144 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-29 01:56:00,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:56:00,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1522036689, now seen corresponding path program 1 times [2023-11-29 01:56:00,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:56:00,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726365924] [2023-11-29 01:56:00,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:56:00,146 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-29 01:56:00,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:56:00,148 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:56:00,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:56:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:00,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 01:56:00,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:56:00,628 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t2562~0#1.base_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t2561~0#1.base_47| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2561~0#1.base_47|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2561~0#1.base_47| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2562~0#1.base_43| (_ bv0 1))) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2561~0#1.base_47| (_ bv1 1)) |v_ULTIMATE.start_main_~#t2562~0#1.base_43|)))) is different from true [2023-11-29 01:56:00,629 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-29 01:56:00,629 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:56:00,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:56:00,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726365924] [2023-11-29 01:56:00,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726365924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:56:00,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:56:00,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:56:00,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91980467] [2023-11-29 01:56:00,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:56:00,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:56:00,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:56:00,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:56:00,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-29 01:56:00,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2023-11-29 01:56:00,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:56:00,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:56:00,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2023-11-29 01:56:00,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:56:00,787 INFO L124 PetriNetUnfolderBase]: 52/152 cut-off events. [2023-11-29 01:56:00,788 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-29 01:56:00,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 152 events. 52/152 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 542 event pairs, 44 based on Foata normal form. 4/142 useless extension candidates. Maximal degree in co-relation 307. Up to 94 conditions per place. [2023-11-29 01:56:00,789 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 19 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2023-11-29 01:56:00,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 168 flow [2023-11-29 01:56:00,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:56:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:56:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2023-11-29 01:56:00,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-11-29 01:56:00,791 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 100 transitions. [2023-11-29 01:56:00,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 100 transitions. [2023-11-29 01:56:00,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:56:00,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 100 transitions. [2023-11-29 01:56:00,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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-29 01:56:00,793 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-29 01:56:00,793 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-29 01:56:00,793 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 108 flow. Second operand 5 states and 100 transitions. [2023-11-29 01:56:00,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 168 flow [2023-11-29 01:56:00,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 140 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-29 01:56:00,796 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 103 flow [2023-11-29 01:56:00,796 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-29 01:56:00,797 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2023-11-29 01:56:00,797 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 103 flow [2023-11-29 01:56:00,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:56:00,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:56:00,798 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-29 01:56:00,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:56:01,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:56:01,001 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-29 01:56:01,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:56:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1843263478, now seen corresponding path program 1 times [2023-11-29 01:56:01,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:56:01,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358169536] [2023-11-29 01:56:01,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:56:01,002 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-29 01:56:01,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:56:01,003 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:56:01,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:56:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:01,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:56:01,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:56:01,150 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-29 01:56:01,150 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:56:01,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:56:01,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358169536] [2023-11-29 01:56:01,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358169536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:56:01,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:56:01,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:56:01,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476939167] [2023-11-29 01:56:01,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:56:01,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:56:01,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:56:01,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:56:01,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:56:01,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-29 01:56:01,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:56:01,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:56:01,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-29 01:56:01,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:56:01,295 INFO L124 PetriNetUnfolderBase]: 118/305 cut-off events. [2023-11-29 01:56:01,295 INFO L125 PetriNetUnfolderBase]: For 96/100 co-relation queries the response was YES. [2023-11-29 01:56:01,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 305 events. 118/305 cut-off events. For 96/100 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1277 event pairs, 57 based on Foata normal form. 4/296 useless extension candidates. Maximal degree in co-relation 678. Up to 139 conditions per place. [2023-11-29 01:56:01,298 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 32 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2023-11-29 01:56:01,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 232 flow [2023-11-29 01:56:01,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:56:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:56:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2023-11-29 01:56:01,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2023-11-29 01:56:01,299 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 129 transitions. [2023-11-29 01:56:01,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 129 transitions. [2023-11-29 01:56:01,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:56:01,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 129 transitions. [2023-11-29 01:56:01,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:56:01,301 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-29 01:56:01,301 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-29 01:56:01,302 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 103 flow. Second operand 5 states and 129 transitions. [2023-11-29 01:56:01,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 232 flow [2023-11-29 01:56:01,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 222 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 01:56:01,304 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 134 flow [2023-11-29 01:56:01,304 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=5, PETRI_FLOW=134, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-11-29 01:56:01,305 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-11-29 01:56:01,305 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 134 flow [2023-11-29 01:56:01,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:56:01,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:56:01,306 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-29 01:56:01,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 01:56:01,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:56:01,510 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-29 01:56:01,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:56:01,510 INFO L85 PathProgramCache]: Analyzing trace with hash 128981278, now seen corresponding path program 2 times [2023-11-29 01:56:01,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:56:01,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150251412] [2023-11-29 01:56:01,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:56:01,511 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-29 01:56:01,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:56:01,512 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:56:01,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:56:01,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 01:56:01,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:56:01,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 01:56:01,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:56:01,839 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-29 01:56:01,840 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:56:01,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:56:01,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150251412] [2023-11-29 01:56:01,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150251412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:56:01,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:56:01,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:56:01,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678703734] [2023-11-29 01:56:01,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:56:01,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:56:01,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:56:01,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:56:01,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:56:01,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2023-11-29 01:56:01,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 134 flow. Second operand has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:56:01,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:56:01,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2023-11-29 01:56:01,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:56:02,157 INFO L124 PetriNetUnfolderBase]: 155/424 cut-off events. [2023-11-29 01:56:02,157 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2023-11-29 01:56:02,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 424 events. 155/424 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2118 event pairs, 38 based on Foata normal form. 4/412 useless extension candidates. Maximal degree in co-relation 1043. Up to 165 conditions per place. [2023-11-29 01:56:02,160 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 35 selfloop transitions, 12 changer transitions 0/65 dead transitions. [2023-11-29 01:56:02,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 328 flow [2023-11-29 01:56:02,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:56:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 01:56:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2023-11-29 01:56:02,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6005291005291006 [2023-11-29 01:56:02,163 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 227 transitions. [2023-11-29 01:56:02,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 227 transitions. [2023-11-29 01:56:02,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:56:02,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 227 transitions. [2023-11-29 01:56:02,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 25.22222222222222) internal successors, (227), 9 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:56:02,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 42.0) internal successors, (420), 10 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:56:02,166 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 42.0) internal successors, (420), 10 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:56:02,166 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 134 flow. Second operand 9 states and 227 transitions. [2023-11-29 01:56:02,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 328 flow [2023-11-29 01:56:02,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:56:02,170 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 226 flow [2023-11-29 01:56:02,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=226, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-11-29 01:56:02,171 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2023-11-29 01:56:02,172 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 226 flow [2023-11-29 01:56:02,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:56:02,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:56:02,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:56:02,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 01:56:02,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:56:02,377 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-29 01:56:02,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:56:02,378 INFO L85 PathProgramCache]: Analyzing trace with hash 649064142, now seen corresponding path program 3 times [2023-11-29 01:56:02,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:56:02,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437309415] [2023-11-29 01:56:02,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:56:02,378 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-29 01:56:02,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:56:02,380 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:56:02,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:56:02,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 01:56:02,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:56:02,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:56:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:56:02,632 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 01:56:02,632 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:56:02,633 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-29 01:56:02,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-29 01:56:02,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-29 01:56:02,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-29 01:56:02,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-29 01:56:02,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-29 01:56:02,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-29 01:56:02,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-29 01:56:02,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-29 01:56:02,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-29 01:56:02,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 01:56:02,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/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-29 01:56:02,842 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:56:02,849 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 01:56:02,849 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:56:02,903 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 01:56:02,908 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 01:56:02,918 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 01:56:02,919 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 01:56:02,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:56:02 BasicIcfg [2023-11-29 01:56:02,932 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:56:02,933 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:56:02,933 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:56:02,933 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:56:02,933 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:55:56" (3/4) ... [2023-11-29 01:56:02,935 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 01:56:02,936 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:56:02,937 INFO L158 Benchmark]: Toolchain (without parser) took 8487.54ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 46.7MB in the beginning and 93.7MB in the end (delta: -47.0MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2023-11-29 01:56:02,937 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 71.3MB. Free memory was 47.6MB in the beginning and 47.5MB in the end (delta: 92.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:56:02,938 INFO L158 Benchmark]: CACSL2BoogieTranslator took 658.41ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 46.6MB in the beginning and 73.3MB in the end (delta: -26.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 01:56:02,939 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.55ms. Allocated memory is still 104.9MB. Free memory was 73.3MB in the beginning and 71.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:56:02,939 INFO L158 Benchmark]: Boogie Preprocessor took 67.96ms. Allocated memory is still 104.9MB. Free memory was 71.3MB in the beginning and 67.7MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:56:02,940 INFO L158 Benchmark]: RCFGBuilder took 867.92ms. Allocated memory is still 104.9MB. Free memory was 67.7MB in the beginning and 50.2MB in the end (delta: 17.6MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2023-11-29 01:56:02,940 INFO L158 Benchmark]: TraceAbstraction took 6814.64ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 49.6MB in the beginning and 94.8MB in the end (delta: -45.2MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2023-11-29 01:56:02,941 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 125.8MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:56:02,944 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.28ms. Allocated memory is still 71.3MB. Free memory was 47.6MB in the beginning and 47.5MB in the end (delta: 92.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 658.41ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 46.6MB in the beginning and 73.3MB in the end (delta: -26.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.55ms. Allocated memory is still 104.9MB. Free memory was 73.3MB in the beginning and 71.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.96ms. Allocated memory is still 104.9MB. Free memory was 71.3MB in the beginning and 67.7MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 867.92ms. Allocated memory is still 104.9MB. Free memory was 67.7MB in the beginning and 50.2MB in the end (delta: 17.6MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6814.64ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 49.6MB in the beginning and 94.8MB in the end (delta: -45.2MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 125.8MB. Free memory is still 93.7MB. 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L803] 0 pthread_t t2561; [L804] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2561={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L805] 0 pthread_t t2562; [L806] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2561={7:0}, t2562={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 1 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L778] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L737] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 x$flush_delayed = weak$$choice2 [L745] 1 x$mem_tmp = x [L746] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L747] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L748] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L749] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L750] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L752] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EAX = x [L754] 1 x = x$flush_delayed ? x$mem_tmp : x [L755] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L781] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561={7:0}, t2562={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L810] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L810] RET 0 assume_abort_if_not(main$tmp_guard0) [L812] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L813] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L814] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L815] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L816] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561={7:0}, t2562={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561={7:0}, t2562={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 __assert_fail ("0", "safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: 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: 801]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 804]: 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: 806]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 59 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 235 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 34 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 605 IncrementalHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 16 mSDtfsCounter, 605 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=10, InterpolantAutomatonStates: 43, 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.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 125 ConstructedInterpolants, 1 QuantifiedInterpolants, 860 SizeOfPredicates, 8 NumberOfNonLiveVariables, 910 ConjunctsInSsa, 52 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-29 01:56:02,968 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b64677fe-4f81-47fd-88ad-35ee56c7781e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample