./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:07:40,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:07:40,331 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 23:07:40,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:07:40,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:07:40,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:07:40,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:07:40,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:07:40,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:07:40,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:07:40,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:07:40,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:07:40,408 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:07:40,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:07:40,411 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:07:40,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:07:40,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:07:40,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:07:40,414 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:07:40,414 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:07:40,415 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:07:40,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:07:40,418 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:07:40,419 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:07:40,420 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:07:40,420 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:07:40,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:07:40,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:07:40,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:07:40,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:07:40,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:07:40,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:07:40,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:07:40,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:07:40,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:07:40,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:07:40,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:07:40,429 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:07:40,429 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_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 [2023-11-06 23:07:40,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:07:40,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:07:40,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:07:40,873 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:07:40,874 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:07:40,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-06 23:07:44,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:07:44,823 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:07:44,824 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-06 23:07:44,850 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/data/ae346103d/cd86d909e2fd4ce8996be2b7bf030b68/FLAGcd0f8031a [2023-11-06 23:07:44,875 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/data/ae346103d/cd86d909e2fd4ce8996be2b7bf030b68 [2023-11-06 23:07:44,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:07:44,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:07:44,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:07:44,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:07:44,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:07:44,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:07:44" (1/1) ... [2023-11-06 23:07:44,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0cc72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:44, skipping insertion in model container [2023-11-06 23:07:44,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:07:44" (1/1) ... [2023-11-06 23:07:44,957 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:07:45,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:07:45,514 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:07:45,591 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:07:45,641 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:07:45,641 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:07:45,650 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:07:45,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:45 WrapperNode [2023-11-06 23:07:45,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:07:45,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:07:45,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:07:45,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:07:45,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:45" (1/1) ... [2023-11-06 23:07:45,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:45" (1/1) ... [2023-11-06 23:07:45,756 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2023-11-06 23:07:45,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:07:45,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:07:45,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:07:45,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:07:45,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:45" (1/1) ... [2023-11-06 23:07:45,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:45" (1/1) ... [2023-11-06 23:07:45,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:45" (1/1) ... [2023-11-06 23:07:45,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:45" (1/1) ... [2023-11-06 23:07:45,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:45" (1/1) ... [2023-11-06 23:07:45,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:45" (1/1) ... [2023-11-06 23:07:45,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:45" (1/1) ... [2023-11-06 23:07:45,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:45" (1/1) ... [2023-11-06 23:07:45,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:07:45,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:07:45,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:07:45,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:07:45,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:45" (1/1) ... [2023-11-06 23:07:45,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:07:45,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:07:45,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:07:45,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:07:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:07:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:07:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:07:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:07:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:07:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:07:45,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:07:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:07:45,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:07:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:07:45,924 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:07:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:07:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:07:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:07:45,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:07:45,929 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 23:07:46,211 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:07:46,214 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:07:46,780 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:07:46,997 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:07:46,997 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:07:47,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:47 BoogieIcfgContainer [2023-11-06 23:07:47,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:07:47,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:07:47,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:07:47,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:07:47,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:07:44" (1/3) ... [2023-11-06 23:07:47,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5ac247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:07:47, skipping insertion in model container [2023-11-06 23:07:47,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:45" (2/3) ... [2023-11-06 23:07:47,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5ac247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:07:47, skipping insertion in model container [2023-11-06 23:07:47,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:47" (3/3) ... [2023-11-06 23:07:47,019 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-06 23:07:47,044 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:07:47,045 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 23:07:47,045 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:07:47,154 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:07:47,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 125 transitions, 262 flow [2023-11-06 23:07:47,289 INFO L124 PetriNetUnfolderBase]: 3/122 cut-off events. [2023-11-06 23:07:47,290 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:07:47,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 3/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-06 23:07:47,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 125 transitions, 262 flow [2023-11-06 23:07:47,304 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 122 transitions, 253 flow [2023-11-06 23:07:47,309 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:07:47,323 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 122 transitions, 253 flow [2023-11-06 23:07:47,327 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 122 transitions, 253 flow [2023-11-06 23:07:47,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 122 transitions, 253 flow [2023-11-06 23:07:47,373 INFO L124 PetriNetUnfolderBase]: 3/122 cut-off events. [2023-11-06 23:07:47,373 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:07:47,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 3/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-06 23:07:47,378 INFO L119 LiptonReduction]: Number of co-enabled transitions 2374 [2023-11-06 23:07:53,919 INFO L134 LiptonReduction]: Checked pairs total: 5825 [2023-11-06 23:07:53,919 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-11-06 23:07:53,956 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:07:53,972 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;@130ae7d3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:07:53,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 23:07:53,976 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:07:53,976 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:07:53,977 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:07:53,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:53,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:07:53,979 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:07:53,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash 558, now seen corresponding path program 1 times [2023-11-06 23:07:53,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:53,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257980545] [2023-11-06 23:07:53,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:54,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:07:54,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:54,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257980545] [2023-11-06 23:07:54,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257980545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:54,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:54,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:07:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33142222] [2023-11-06 23:07:54,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:54,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:07:54,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:54,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:07:54,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:07:54,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 250 [2023-11-06 23:07:54,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:54,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:54,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 250 [2023-11-06 23:07:54,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:54,756 INFO L124 PetriNetUnfolderBase]: 1277/1924 cut-off events. [2023-11-06 23:07:54,757 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-06 23:07:54,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3865 conditions, 1924 events. 1277/1924 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8905 event pairs, 1277 based on Foata normal form. 0/1623 useless extension candidates. Maximal degree in co-relation 3854. Up to 1887 conditions per place. [2023-11-06 23:07:54,782 INFO L140 encePairwiseOnDemand]: 243/250 looper letters, 22 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-11-06 23:07:54,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 101 flow [2023-11-06 23:07:54,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:07:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:07:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 253 transitions. [2023-11-06 23:07:54,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.506 [2023-11-06 23:07:54,803 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 253 transitions. [2023-11-06 23:07:54,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 253 transitions. [2023-11-06 23:07:54,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:54,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 253 transitions. [2023-11-06 23:07:54,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:54,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:54,821 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:54,824 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 253 transitions. [2023-11-06 23:07:54,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 101 flow [2023-11-06 23:07:54,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:07:54,831 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-11-06 23:07:54,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-11-06 23:07:54,838 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-11-06 23:07:54,838 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-11-06 23:07:54,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:54,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:54,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:07:54,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:07:54,840 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:07:54,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:54,841 INFO L85 PathProgramCache]: Analyzing trace with hash 526839740, now seen corresponding path program 1 times [2023-11-06 23:07:54,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:54,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883114458] [2023-11-06 23:07:54,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:54,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:07:55,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:55,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883114458] [2023-11-06 23:07:55,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883114458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:55,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:55,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:07:55,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401816109] [2023-11-06 23:07:55,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:55,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:07:55,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:55,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:07:55,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:07:55,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 250 [2023-11-06 23:07:55,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:55,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:55,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 250 [2023-11-06 23:07:55,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:55,803 INFO L124 PetriNetUnfolderBase]: 999/1616 cut-off events. [2023-11-06 23:07:55,803 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:07:55,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3149 conditions, 1616 events. 999/1616 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8290 event pairs, 165 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 3146. Up to 1195 conditions per place. [2023-11-06 23:07:55,819 INFO L140 encePairwiseOnDemand]: 247/250 looper letters, 31 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-11-06 23:07:55,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 152 flow [2023-11-06 23:07:55,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:07:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:07:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-11-06 23:07:55,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.492 [2023-11-06 23:07:55,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-11-06 23:07:55,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-11-06 23:07:55,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:55,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-11-06 23:07:55,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:55,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:55,842 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:55,842 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 369 transitions. [2023-11-06 23:07:55,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 152 flow [2023-11-06 23:07:55,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:07:55,849 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-11-06 23:07:55,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-11-06 23:07:55,851 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-11-06 23:07:55,851 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-11-06 23:07:55,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:55,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:55,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:55,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:07:55,862 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:07:55,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash 675488639, now seen corresponding path program 1 times [2023-11-06 23:07:55,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:55,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430534304] [2023-11-06 23:07:55,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:55,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:07:56,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:56,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430534304] [2023-11-06 23:07:56,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430534304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:56,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:56,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:07:56,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994811937] [2023-11-06 23:07:56,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:56,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:07:56,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:56,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:07:56,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:07:56,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 250 [2023-11-06 23:07:56,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:56,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:56,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 250 [2023-11-06 23:07:56,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:56,708 INFO L124 PetriNetUnfolderBase]: 919/1384 cut-off events. [2023-11-06 23:07:56,708 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2023-11-06 23:07:56,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2919 conditions, 1384 events. 919/1384 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6585 event pairs, 151 based on Foata normal form. 0/1332 useless extension candidates. Maximal degree in co-relation 2915. Up to 1055 conditions per place. [2023-11-06 23:07:56,724 INFO L140 encePairwiseOnDemand]: 245/250 looper letters, 44 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2023-11-06 23:07:56,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 52 transitions, 224 flow [2023-11-06 23:07:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:07:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:07:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2023-11-06 23:07:56,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4736 [2023-11-06 23:07:56,729 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 592 transitions. [2023-11-06 23:07:56,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 592 transitions. [2023-11-06 23:07:56,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:56,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 592 transitions. [2023-11-06 23:07:56,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:56,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:56,739 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:56,739 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 592 transitions. [2023-11-06 23:07:56,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 52 transitions, 224 flow [2023-11-06 23:07:56,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 52 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:07:56,743 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 87 flow [2023-11-06 23:07:56,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2023-11-06 23:07:56,745 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-11-06 23:07:56,745 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 87 flow [2023-11-06 23:07:56,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:56,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:56,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:56,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:07:56,752 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:07:56,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:56,753 INFO L85 PathProgramCache]: Analyzing trace with hash 675488672, now seen corresponding path program 1 times [2023-11-06 23:07:56,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:56,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237554197] [2023-11-06 23:07:56,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:56,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:07:57,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:57,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237554197] [2023-11-06 23:07:57,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237554197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:57,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:57,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:07:57,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334260194] [2023-11-06 23:07:57,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:57,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:07:57,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:57,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:07:57,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:07:57,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 250 [2023-11-06 23:07:57,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 87 flow. Second operand has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:57,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:57,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 250 [2023-11-06 23:07:57,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:58,089 INFO L124 PetriNetUnfolderBase]: 727/1212 cut-off events. [2023-11-06 23:07:58,089 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2023-11-06 23:07:58,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2706 conditions, 1212 events. 727/1212 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5950 event pairs, 44 based on Foata normal form. 112/1324 useless extension candidates. Maximal degree in co-relation 2699. Up to 834 conditions per place. [2023-11-06 23:07:58,103 INFO L140 encePairwiseOnDemand]: 245/250 looper letters, 34 selfloop transitions, 4 changer transitions 4/44 dead transitions. [2023-11-06 23:07:58,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 221 flow [2023-11-06 23:07:58,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:07:58,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:07:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2023-11-06 23:07:58,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4106666666666667 [2023-11-06 23:07:58,107 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 616 transitions. [2023-11-06 23:07:58,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions. [2023-11-06 23:07:58,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:58,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions. [2023-11-06 23:07:58,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:58,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:58,117 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:58,117 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 87 flow. Second operand 6 states and 616 transitions. [2023-11-06 23:07:58,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 221 flow [2023-11-06 23:07:58,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:07:58,124 INFO L231 Difference]: Finished difference. Result has 40 places, 21 transitions, 66 flow [2023-11-06 23:07:58,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=21} [2023-11-06 23:07:58,127 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-06 23:07:58,127 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 21 transitions, 66 flow [2023-11-06 23:07:58,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:58,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:58,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:58,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:07:58,129 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:07:58,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:58,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1128504494, now seen corresponding path program 1 times [2023-11-06 23:07:58,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:58,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242692821] [2023-11-06 23:07:58,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:58,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:07:58,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:58,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242692821] [2023-11-06 23:07:58,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242692821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:58,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:58,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:07:58,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386516003] [2023-11-06 23:07:58,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:58,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:07:58,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:58,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:07:58,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:07:58,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 250 [2023-11-06 23:07:58,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 21 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:58,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:58,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 250 [2023-11-06 23:07:58,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:07:59,104 INFO L124 PetriNetUnfolderBase]: 1578/2419 cut-off events. [2023-11-06 23:07:59,104 INFO L125 PetriNetUnfolderBase]: For 762/762 co-relation queries the response was YES. [2023-11-06 23:07:59,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5506 conditions, 2419 events. 1578/2419 cut-off events. For 762/762 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11400 event pairs, 179 based on Foata normal form. 114/2533 useless extension candidates. Maximal degree in co-relation 5499. Up to 1231 conditions per place. [2023-11-06 23:07:59,124 INFO L140 encePairwiseOnDemand]: 242/250 looper letters, 38 selfloop transitions, 8 changer transitions 26/72 dead transitions. [2023-11-06 23:07:59,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 72 transitions, 342 flow [2023-11-06 23:07:59,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:07:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:07:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 789 transitions. [2023-11-06 23:07:59,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45085714285714285 [2023-11-06 23:07:59,129 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 789 transitions. [2023-11-06 23:07:59,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 789 transitions. [2023-11-06 23:07:59,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:07:59,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 789 transitions. [2023-11-06 23:07:59,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:59,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:59,141 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:59,141 INFO L175 Difference]: Start difference. First operand has 40 places, 21 transitions, 66 flow. Second operand 7 states and 789 transitions. [2023-11-06 23:07:59,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 72 transitions, 342 flow [2023-11-06 23:07:59,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 72 transitions, 314 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-11-06 23:07:59,165 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 121 flow [2023-11-06 23:07:59,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=121, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-11-06 23:07:59,166 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-11-06 23:07:59,166 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 121 flow [2023-11-06 23:07:59,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:59,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:07:59,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:07:59,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:07:59,168 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:07:59,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:59,168 INFO L85 PathProgramCache]: Analyzing trace with hash 586929302, now seen corresponding path program 1 times [2023-11-06 23:07:59,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:59,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75427153] [2023-11-06 23:07:59,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:59,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:07:59,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:59,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75427153] [2023-11-06 23:07:59,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75427153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:59,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:59,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:07:59,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915169050] [2023-11-06 23:07:59,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:59,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:07:59,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:59,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:07:59,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:07:59,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 250 [2023-11-06 23:07:59,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:07:59,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:07:59,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 250 [2023-11-06 23:07:59,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:00,267 INFO L124 PetriNetUnfolderBase]: 2053/3161 cut-off events. [2023-11-06 23:08:00,267 INFO L125 PetriNetUnfolderBase]: For 2740/2740 co-relation queries the response was YES. [2023-11-06 23:08:00,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8890 conditions, 3161 events. 2053/3161 cut-off events. For 2740/2740 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 15737 event pairs, 463 based on Foata normal form. 90/3251 useless extension candidates. Maximal degree in co-relation 8880. Up to 1184 conditions per place. [2023-11-06 23:08:00,291 INFO L140 encePairwiseOnDemand]: 242/250 looper letters, 43 selfloop transitions, 9 changer transitions 21/73 dead transitions. [2023-11-06 23:08:00,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 73 transitions, 433 flow [2023-11-06 23:08:00,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:08:00,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:08:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 680 transitions. [2023-11-06 23:08:00,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2023-11-06 23:08:00,296 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 680 transitions. [2023-11-06 23:08:00,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 680 transitions. [2023-11-06 23:08:00,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:00,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 680 transitions. [2023-11-06 23:08:00,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:00,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:00,305 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:00,305 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 121 flow. Second operand 6 states and 680 transitions. [2023-11-06 23:08:00,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 73 transitions, 433 flow [2023-11-06 23:08:00,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 425 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-06 23:08:00,317 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 170 flow [2023-11-06 23:08:00,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2023-11-06 23:08:00,320 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-11-06 23:08:00,321 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 170 flow [2023-11-06 23:08:00,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:00,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:00,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:00,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:08:00,322 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:00,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:00,323 INFO L85 PathProgramCache]: Analyzing trace with hash 830819211, now seen corresponding path program 1 times [2023-11-06 23:08:00,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:00,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417609271] [2023-11-06 23:08:00,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:00,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:00,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:00,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417609271] [2023-11-06 23:08:00,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417609271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:00,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:00,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:08:00,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306448790] [2023-11-06 23:08:00,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:00,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:00,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:00,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:00,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:00,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 250 [2023-11-06 23:08:00,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 29 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:00,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:00,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 250 [2023-11-06 23:08:00,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:01,412 INFO L124 PetriNetUnfolderBase]: 1658/2583 cut-off events. [2023-11-06 23:08:01,412 INFO L125 PetriNetUnfolderBase]: For 3158/3158 co-relation queries the response was YES. [2023-11-06 23:08:01,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7633 conditions, 2583 events. 1658/2583 cut-off events. For 3158/3158 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 13011 event pairs, 464 based on Foata normal form. 99/2682 useless extension candidates. Maximal degree in co-relation 7620. Up to 793 conditions per place. [2023-11-06 23:08:01,434 INFO L140 encePairwiseOnDemand]: 245/250 looper letters, 32 selfloop transitions, 3 changer transitions 48/83 dead transitions. [2023-11-06 23:08:01,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 83 transitions, 532 flow [2023-11-06 23:08:01,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:08:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:08:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 920 transitions. [2023-11-06 23:08:01,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46 [2023-11-06 23:08:01,441 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 920 transitions. [2023-11-06 23:08:01,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 920 transitions. [2023-11-06 23:08:01,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:01,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 920 transitions. [2023-11-06 23:08:01,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:01,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:01,506 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:01,507 INFO L175 Difference]: Start difference. First operand has 48 places, 29 transitions, 170 flow. Second operand 8 states and 920 transitions. [2023-11-06 23:08:01,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 83 transitions, 532 flow [2023-11-06 23:08:01,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 495 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-11-06 23:08:01,522 INFO L231 Difference]: Finished difference. Result has 54 places, 24 transitions, 128 flow [2023-11-06 23:08:01,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=8, PETRI_FLOW=128, PETRI_PLACES=54, PETRI_TRANSITIONS=24} [2023-11-06 23:08:01,523 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2023-11-06 23:08:01,524 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 24 transitions, 128 flow [2023-11-06 23:08:01,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:01,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:01,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:01,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:08:01,525 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:01,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:01,526 INFO L85 PathProgramCache]: Analyzing trace with hash 408890166, now seen corresponding path program 2 times [2023-11-06 23:08:01,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:01,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572461035] [2023-11-06 23:08:01,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:01,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:01,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:01,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572461035] [2023-11-06 23:08:01,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572461035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:01,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:01,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:01,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263967324] [2023-11-06 23:08:01,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:01,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:01,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:01,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:01,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:01,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 250 [2023-11-06 23:08:01,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 24 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:01,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:01,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 250 [2023-11-06 23:08:01,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:02,274 INFO L124 PetriNetUnfolderBase]: 1046/1665 cut-off events. [2023-11-06 23:08:02,275 INFO L125 PetriNetUnfolderBase]: For 2935/2935 co-relation queries the response was YES. [2023-11-06 23:08:02,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4736 conditions, 1665 events. 1046/1665 cut-off events. For 2935/2935 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7740 event pairs, 464 based on Foata normal form. 90/1755 useless extension candidates. Maximal degree in co-relation 4720. Up to 918 conditions per place. [2023-11-06 23:08:02,288 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 26 selfloop transitions, 3 changer transitions 21/50 dead transitions. [2023-11-06 23:08:02,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 336 flow [2023-11-06 23:08:02,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:08:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:08:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2023-11-06 23:08:02,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4592 [2023-11-06 23:08:02,293 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 574 transitions. [2023-11-06 23:08:02,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 574 transitions. [2023-11-06 23:08:02,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:02,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 574 transitions. [2023-11-06 23:08:02,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:02,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:02,302 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:02,302 INFO L175 Difference]: Start difference. First operand has 54 places, 24 transitions, 128 flow. Second operand 5 states and 574 transitions. [2023-11-06 23:08:02,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 336 flow [2023-11-06 23:08:02,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 277 flow, removed 11 selfloop flow, removed 11 redundant places. [2023-11-06 23:08:02,314 INFO L231 Difference]: Finished difference. Result has 44 places, 21 transitions, 87 flow [2023-11-06 23:08:02,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=44, PETRI_TRANSITIONS=21} [2023-11-06 23:08:02,315 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-11-06 23:08:02,316 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 21 transitions, 87 flow [2023-11-06 23:08:02,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:02,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:02,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:02,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:08:02,317 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:02,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:02,318 INFO L85 PathProgramCache]: Analyzing trace with hash -434178967, now seen corresponding path program 1 times [2023-11-06 23:08:02,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:02,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351123686] [2023-11-06 23:08:02,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:02,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:02,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:02,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351123686] [2023-11-06 23:08:02,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351123686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:02,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:02,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:02,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808451933] [2023-11-06 23:08:02,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:02,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:08:02,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:02,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:08:02,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:08:02,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 250 [2023-11-06 23:08:02,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 21 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:02,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:02,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 250 [2023-11-06 23:08:02,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:02,838 INFO L124 PetriNetUnfolderBase]: 244/427 cut-off events. [2023-11-06 23:08:02,838 INFO L125 PetriNetUnfolderBase]: For 298/300 co-relation queries the response was YES. [2023-11-06 23:08:02,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 427 events. 244/427 cut-off events. For 298/300 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1623 event pairs, 50 based on Foata normal form. 41/467 useless extension candidates. Maximal degree in co-relation 1171. Up to 290 conditions per place. [2023-11-06 23:08:02,843 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 25 selfloop transitions, 4 changer transitions 18/49 dead transitions. [2023-11-06 23:08:02,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 275 flow [2023-11-06 23:08:02,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:08:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:08:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 579 transitions. [2023-11-06 23:08:02,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4632 [2023-11-06 23:08:02,849 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 579 transitions. [2023-11-06 23:08:02,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 579 transitions. [2023-11-06 23:08:02,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:02,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 579 transitions. [2023-11-06 23:08:02,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:02,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:02,857 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:02,857 INFO L175 Difference]: Start difference. First operand has 44 places, 21 transitions, 87 flow. Second operand 5 states and 579 transitions. [2023-11-06 23:08:02,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 275 flow [2023-11-06 23:08:02,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 246 flow, removed 3 selfloop flow, removed 8 redundant places. [2023-11-06 23:08:02,861 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 103 flow [2023-11-06 23:08:02,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2023-11-06 23:08:02,862 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-11-06 23:08:02,862 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 103 flow [2023-11-06 23:08:02,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:02,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:02,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:02,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:08:02,864 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:02,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:02,865 INFO L85 PathProgramCache]: Analyzing trace with hash -421050290, now seen corresponding path program 1 times [2023-11-06 23:08:02,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:02,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809393538] [2023-11-06 23:08:02,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:02,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:03,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:03,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809393538] [2023-11-06 23:08:03,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809393538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:03,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:03,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:08:03,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842861303] [2023-11-06 23:08:03,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:03,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:03,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:03,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:03,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:03,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 250 [2023-11-06 23:08:03,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:03,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:03,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 250 [2023-11-06 23:08:03,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:03,329 INFO L124 PetriNetUnfolderBase]: 106/216 cut-off events. [2023-11-06 23:08:03,329 INFO L125 PetriNetUnfolderBase]: For 162/163 co-relation queries the response was YES. [2023-11-06 23:08:03,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 216 events. 106/216 cut-off events. For 162/163 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 696 event pairs, 18 based on Foata normal form. 25/240 useless extension candidates. Maximal degree in co-relation 710. Up to 91 conditions per place. [2023-11-06 23:08:03,332 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 29 selfloop transitions, 7 changer transitions 16/54 dead transitions. [2023-11-06 23:08:03,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 339 flow [2023-11-06 23:08:03,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:08:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:08:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2023-11-06 23:08:03,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46 [2023-11-06 23:08:03,337 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 690 transitions. [2023-11-06 23:08:03,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 690 transitions. [2023-11-06 23:08:03,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:03,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 690 transitions. [2023-11-06 23:08:03,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:03,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:03,346 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:03,346 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 103 flow. Second operand 6 states and 690 transitions. [2023-11-06 23:08:03,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 339 flow [2023-11-06 23:08:03,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 333 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 23:08:03,349 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 153 flow [2023-11-06 23:08:03,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2023-11-06 23:08:03,350 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-11-06 23:08:03,351 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 153 flow [2023-11-06 23:08:03,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:03,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:03,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:03,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:08:03,352 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:03,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:03,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1508170466, now seen corresponding path program 1 times [2023-11-06 23:08:03,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:03,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583124709] [2023-11-06 23:08:03,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:03,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:03,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:03,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583124709] [2023-11-06 23:08:03,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583124709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:03,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:03,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:08:03,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648211222] [2023-11-06 23:08:03,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:03,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:08:03,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:03,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:08:03,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:08:03,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 250 [2023-11-06 23:08:03,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:03,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:03,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 250 [2023-11-06 23:08:03,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:03,836 INFO L124 PetriNetUnfolderBase]: 54/121 cut-off events. [2023-11-06 23:08:03,837 INFO L125 PetriNetUnfolderBase]: For 172/173 co-relation queries the response was YES. [2023-11-06 23:08:03,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 121 events. 54/121 cut-off events. For 172/173 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 306 event pairs, 14 based on Foata normal form. 8/128 useless extension candidates. Maximal degree in co-relation 440. Up to 48 conditions per place. [2023-11-06 23:08:03,839 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 26 selfloop transitions, 10 changer transitions 8/46 dead transitions. [2023-11-06 23:08:03,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 332 flow [2023-11-06 23:08:03,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:08:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:08:03,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 788 transitions. [2023-11-06 23:08:03,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4502857142857143 [2023-11-06 23:08:03,844 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 788 transitions. [2023-11-06 23:08:03,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 788 transitions. [2023-11-06 23:08:03,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:03,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 788 transitions. [2023-11-06 23:08:03,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.57142857142857) internal successors, (788), 7 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:03,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:03,854 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:03,854 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 153 flow. Second operand 7 states and 788 transitions. [2023-11-06 23:08:03,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 332 flow [2023-11-06 23:08:03,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 269 flow, removed 25 selfloop flow, removed 6 redundant places. [2023-11-06 23:08:03,858 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 143 flow [2023-11-06 23:08:03,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2023-11-06 23:08:03,859 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-11-06 23:08:03,859 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 143 flow [2023-11-06 23:08:03,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:03,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:03,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:03,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:08:03,860 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:03,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:03,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1978152264, now seen corresponding path program 1 times [2023-11-06 23:08:03,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:03,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547948289] [2023-11-06 23:08:03,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:03,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:04,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:04,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547948289] [2023-11-06 23:08:04,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547948289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:04,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:04,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:08:04,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399605922] [2023-11-06 23:08:04,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:04,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:08:04,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:04,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:08:04,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:08:05,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 250 [2023-11-06 23:08:05,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 143 flow. Second operand has 8 states, 8 states have (on average 99.625) internal successors, (797), 8 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:05,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:05,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 250 [2023-11-06 23:08:05,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:05,504 INFO L124 PetriNetUnfolderBase]: 60/136 cut-off events. [2023-11-06 23:08:05,505 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2023-11-06 23:08:05,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 136 events. 60/136 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 357 event pairs, 11 based on Foata normal form. 1/137 useless extension candidates. Maximal degree in co-relation 469. Up to 55 conditions per place. [2023-11-06 23:08:05,506 INFO L140 encePairwiseOnDemand]: 242/250 looper letters, 29 selfloop transitions, 5 changer transitions 20/54 dead transitions. [2023-11-06 23:08:05,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 408 flow [2023-11-06 23:08:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:08:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:08:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 914 transitions. [2023-11-06 23:08:05,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4062222222222222 [2023-11-06 23:08:05,513 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 914 transitions. [2023-11-06 23:08:05,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 914 transitions. [2023-11-06 23:08:05,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:05,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 914 transitions. [2023-11-06 23:08:05,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.55555555555556) internal successors, (914), 9 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:05,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 250.0) internal successors, (2500), 10 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:05,531 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 250.0) internal successors, (2500), 10 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:05,531 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 143 flow. Second operand 9 states and 914 transitions. [2023-11-06 23:08:05,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 408 flow [2023-11-06 23:08:05,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 328 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-11-06 23:08:05,535 INFO L231 Difference]: Finished difference. Result has 49 places, 27 transitions, 123 flow [2023-11-06 23:08:05,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=123, PETRI_PLACES=49, PETRI_TRANSITIONS=27} [2023-11-06 23:08:05,538 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-11-06 23:08:05,539 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 27 transitions, 123 flow [2023-11-06 23:08:05,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.625) internal successors, (797), 8 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:05,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:05,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:05,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:08:05,540 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:05,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:05,541 INFO L85 PathProgramCache]: Analyzing trace with hash -163490656, now seen corresponding path program 2 times [2023-11-06 23:08:05,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:05,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571493564] [2023-11-06 23:08:05,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:05,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:08:05,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:08:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:08:05,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:08:05,763 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:08:05,764 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 23:08:05,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 23:08:05,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 23:08:05,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 23:08:05,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 23:08:05,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 23:08:05,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 23:08:05,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 23:08:05,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 23:08:05,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 23:08:05,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 23:08:05,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 23:08:05,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 23:08:05,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:08:05,771 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:05,778 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:08:05,779 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:08:05,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:08:05 BasicIcfg [2023-11-06 23:08:05,904 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:08:05,905 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:08:05,905 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:08:05,905 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:08:05,906 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:47" (3/4) ... [2023-11-06 23:08:05,908 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:08:05,910 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:08:05,910 INFO L158 Benchmark]: Toolchain (without parser) took 21030.22ms. Allocated memory was 125.8MB in the beginning and 356.5MB in the end (delta: 230.7MB). Free memory was 82.4MB in the beginning and 169.8MB in the end (delta: -87.4MB). Peak memory consumption was 143.8MB. Max. memory is 16.1GB. [2023-11-06 23:08:05,911 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 125.8MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:08:05,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 769.46ms. Allocated memory is still 125.8MB. Free memory was 81.9MB in the beginning and 59.3MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 23:08:05,912 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.08ms. Allocated memory is still 125.8MB. Free memory was 59.3MB in the beginning and 56.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:08:05,912 INFO L158 Benchmark]: Boogie Preprocessor took 47.78ms. Allocated memory is still 125.8MB. Free memory was 56.7MB in the beginning and 54.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:08:05,913 INFO L158 Benchmark]: RCFGBuilder took 1194.99ms. Allocated memory was 125.8MB in the beginning and 172.0MB in the end (delta: 46.1MB). Free memory was 54.6MB in the beginning and 117.1MB in the end (delta: -62.4MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2023-11-06 23:08:05,913 INFO L158 Benchmark]: TraceAbstraction took 18897.90ms. Allocated memory was 172.0MB in the beginning and 356.5MB in the end (delta: 184.5MB). Free memory was 116.0MB in the beginning and 169.8MB in the end (delta: -53.8MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. [2023-11-06 23:08:05,913 INFO L158 Benchmark]: Witness Printer took 4.83ms. Allocated memory is still 356.5MB. Free memory is still 169.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:08:05,916 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.36ms. Allocated memory is still 125.8MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 769.46ms. Allocated memory is still 125.8MB. Free memory was 81.9MB in the beginning and 59.3MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.08ms. Allocated memory is still 125.8MB. Free memory was 59.3MB in the beginning and 56.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.78ms. Allocated memory is still 125.8MB. Free memory was 56.7MB in the beginning and 54.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1194.99ms. Allocated memory was 125.8MB in the beginning and 172.0MB in the end (delta: 46.1MB). Free memory was 54.6MB in the beginning and 117.1MB in the end (delta: -62.4MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18897.90ms. Allocated memory was 172.0MB in the beginning and 356.5MB in the end (delta: 184.5MB). Free memory was 116.0MB in the beginning and 169.8MB in the end (delta: -53.8MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. * Witness Printer took 4.83ms. Allocated memory is still 356.5MB. Free memory is still 169.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 129 PlacesBefore, 40 PlacesAfterwards, 122 TransitionsBefore, 31 TransitionsAfterwards, 2374 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 125 TotalNumberOfCompositions, 5825 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2264, independent: 2102, independent conditional: 0, independent unconditional: 2102, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1218, independent: 1191, independent conditional: 0, independent unconditional: 1191, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2264, independent: 911, independent conditional: 0, independent unconditional: 911, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 1218, unknown conditional: 0, unknown unconditional: 1218] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1828, ((void *)0), P0, ((void *)0))=-2, t1828={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1829, ((void *)0), P1, ((void *)0))=-1, t1828={5:0}, t1829={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1830, ((void *)0), P2, ((void *)0))=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 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) [L752] 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)) [L753] 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)) [L754] 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)) [L755] 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)) [L756] 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)) [L757] 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)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L787] 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) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 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 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 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 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe002_power.opt_pso.oepc_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=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: -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: 827]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 830]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 670 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 552 mSDsluCounter, 269 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 235 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1474 IncrementalHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 34 mSDtfsCounter, 1474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=6, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 23:08:05,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:08:09,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:08:09,157 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 23:08:09,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:08:09,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:08:09,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:08:09,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:08:09,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:08:09,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:08:09,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:08:09,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:08:09,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:08:09,207 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:08:09,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:08:09,208 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:08:09,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:08:09,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:08:09,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:08:09,211 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:08:09,211 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:08:09,212 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:08:09,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:08:09,213 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:08:09,214 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 23:08:09,214 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 23:08:09,215 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:08:09,216 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:08:09,216 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:08:09,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:08:09,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:08:09,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:08:09,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:08:09,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:08:09,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:08:09,220 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 23:08:09,221 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 23:08:09,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:08:09,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:08:09,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:08:09,223 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 23:08:09,223 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:08:09,224 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_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 [2023-11-06 23:08:09,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:08:09,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:08:09,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:08:09,763 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:08:09,764 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:08:09,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-06 23:08:13,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:08:14,093 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:08:14,093 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-06 23:08:14,119 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/data/bc55e9dae/76fed39183d845c6a11d68955d524639/FLAG92411b703 [2023-11-06 23:08:14,142 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/data/bc55e9dae/76fed39183d845c6a11d68955d524639 [2023-11-06 23:08:14,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:08:14,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:08:14,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:08:14,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:08:14,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:08:14,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:08:14" (1/1) ... [2023-11-06 23:08:14,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41dff2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:14, skipping insertion in model container [2023-11-06 23:08:14,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:08:14" (1/1) ... [2023-11-06 23:08:14,266 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:08:14,917 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:08:14,944 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:08:15,069 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:08:15,141 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:08:15,141 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:08:15,151 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:08:15,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:15 WrapperNode [2023-11-06 23:08:15,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:08:15,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:08:15,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:08:15,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:08:15,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:15" (1/1) ... [2023-11-06 23:08:15,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:15" (1/1) ... [2023-11-06 23:08:15,272 INFO L138 Inliner]: procedures = 179, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-11-06 23:08:15,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:08:15,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:08:15,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:08:15,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:08:15,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:15" (1/1) ... [2023-11-06 23:08:15,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:15" (1/1) ... [2023-11-06 23:08:15,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:15" (1/1) ... [2023-11-06 23:08:15,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:15" (1/1) ... [2023-11-06 23:08:15,339 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:15" (1/1) ... [2023-11-06 23:08:15,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:15" (1/1) ... [2023-11-06 23:08:15,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:15" (1/1) ... [2023-11-06 23:08:15,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:15" (1/1) ... [2023-11-06 23:08:15,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:08:15,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:08:15,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:08:15,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:08:15,376 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:15" (1/1) ... [2023-11-06 23:08:15,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:08:15,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:15,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:08:15,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:08:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:08:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:08:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:08:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:08:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 23:08:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 23:08:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:08:15,488 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:08:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:08:15,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:08:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:08:15,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:08:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:08:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:08:15,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:08:15,492 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 23:08:15,690 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:08:15,693 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:08:16,267 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:08:16,570 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:08:16,570 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:08:16,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:16 BoogieIcfgContainer [2023-11-06 23:08:16,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:08:16,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:08:16,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:08:16,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:08:16,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:08:14" (1/3) ... [2023-11-06 23:08:16,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@701bbe41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:08:16, skipping insertion in model container [2023-11-06 23:08:16,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:15" (2/3) ... [2023-11-06 23:08:16,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@701bbe41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:08:16, skipping insertion in model container [2023-11-06 23:08:16,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:16" (3/3) ... [2023-11-06 23:08:16,586 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-06 23:08:16,610 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:08:16,611 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 23:08:16,611 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:08:16,729 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:08:16,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 126 transitions, 264 flow [2023-11-06 23:08:16,878 INFO L124 PetriNetUnfolderBase]: 3/123 cut-off events. [2023-11-06 23:08:16,884 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:08:16,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 3/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-06 23:08:16,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 126 transitions, 264 flow [2023-11-06 23:08:16,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 123 transitions, 255 flow [2023-11-06 23:08:16,914 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:08:16,934 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 123 transitions, 255 flow [2023-11-06 23:08:16,941 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 123 transitions, 255 flow [2023-11-06 23:08:16,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 123 transitions, 255 flow [2023-11-06 23:08:16,991 INFO L124 PetriNetUnfolderBase]: 3/123 cut-off events. [2023-11-06 23:08:16,991 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:08:16,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 3/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-06 23:08:16,996 INFO L119 LiptonReduction]: Number of co-enabled transitions 2374 [2023-11-06 23:08:28,079 INFO L134 LiptonReduction]: Checked pairs total: 5999 [2023-11-06 23:08:28,079 INFO L136 LiptonReduction]: Total number of compositions: 128 [2023-11-06 23:08:28,098 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:08:28,107 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;@5be15f4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:08:28,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 23:08:28,109 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:08:28,110 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:08:28,110 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:08:28,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:28,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:08:28,112 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:28,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash 562, now seen corresponding path program 1 times [2023-11-06 23:08:28,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:08:28,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359381593] [2023-11-06 23:08:28,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:28,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:28,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:08:28,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:08:28,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 23:08:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:28,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 23:08:28,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:28,287 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:08:28,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:08:28,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359381593] [2023-11-06 23:08:28,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359381593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:28,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:28,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:08:28,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269665410] [2023-11-06 23:08:28,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:28,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:08:28,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:08:28,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:08:28,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:08:28,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 254 [2023-11-06 23:08:28,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:28,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:28,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 254 [2023-11-06 23:08:28,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:29,067 INFO L124 PetriNetUnfolderBase]: 1277/1924 cut-off events. [2023-11-06 23:08:29,067 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-06 23:08:29,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3865 conditions, 1924 events. 1277/1924 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8947 event pairs, 1277 based on Foata normal form. 0/1623 useless extension candidates. Maximal degree in co-relation 3854. Up to 1887 conditions per place. [2023-11-06 23:08:29,093 INFO L140 encePairwiseOnDemand]: 247/254 looper letters, 22 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-11-06 23:08:29,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 101 flow [2023-11-06 23:08:29,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:08:29,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:08:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 255 transitions. [2023-11-06 23:08:29,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5019685039370079 [2023-11-06 23:08:29,115 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 255 transitions. [2023-11-06 23:08:29,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 255 transitions. [2023-11-06 23:08:29,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:29,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 255 transitions. [2023-11-06 23:08:29,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:29,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:29,134 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:29,137 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 255 transitions. [2023-11-06 23:08:29,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 101 flow [2023-11-06 23:08:29,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:08:29,143 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-11-06 23:08:29,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-11-06 23:08:29,150 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-11-06 23:08:29,151 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-11-06 23:08:29,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:29,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:29,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:08:29,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:29,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:29,366 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:29,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:29,367 INFO L85 PathProgramCache]: Analyzing trace with hash 532452044, now seen corresponding path program 1 times [2023-11-06 23:08:29,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:08:29,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717144032] [2023-11-06 23:08:29,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:29,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:29,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:08:29,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:08:29,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 23:08:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:29,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:08:29,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:29,585 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:08:29,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:08:29,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717144032] [2023-11-06 23:08:29,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717144032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:29,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:29,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:08:29,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864013692] [2023-11-06 23:08:29,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:29,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:08:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:08:29,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:08:29,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:08:29,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 254 [2023-11-06 23:08:29,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:29,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:29,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 254 [2023-11-06 23:08:29,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:30,109 INFO L124 PetriNetUnfolderBase]: 999/1560 cut-off events. [2023-11-06 23:08:30,112 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:08:30,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3093 conditions, 1560 events. 999/1560 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7258 event pairs, 277 based on Foata normal form. 0/1428 useless extension candidates. Maximal degree in co-relation 3090. Up to 1195 conditions per place. [2023-11-06 23:08:30,127 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 31 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-11-06 23:08:30,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 152 flow [2023-11-06 23:08:30,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:08:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:08:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-11-06 23:08:30,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4881889763779528 [2023-11-06 23:08:30,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-11-06 23:08:30,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-11-06 23:08:30,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:30,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-11-06 23:08:30,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:30,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:30,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:30,160 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 372 transitions. [2023-11-06 23:08:30,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 152 flow [2023-11-06 23:08:30,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:08:30,162 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-11-06 23:08:30,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-11-06 23:08:30,164 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-11-06 23:08:30,164 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-11-06 23:08:30,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:30,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:30,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:30,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:30,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:30,380 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:30,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash -96395838, now seen corresponding path program 1 times [2023-11-06 23:08:30,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:08:30,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6366795] [2023-11-06 23:08:30,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:30,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:30,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:08:30,387 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:08:30,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 23:08:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:30,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:08:30,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:30,588 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:08:30,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:08:30,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6366795] [2023-11-06 23:08:30,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6366795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:30,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:30,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:30,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686826743] [2023-11-06 23:08:30,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:30,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:08:30,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:08:30,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:08:30,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:08:30,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 254 [2023-11-06 23:08:30,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:30,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:30,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 254 [2023-11-06 23:08:30,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:31,031 INFO L124 PetriNetUnfolderBase]: 557/926 cut-off events. [2023-11-06 23:08:31,032 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-11-06 23:08:31,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1959 conditions, 926 events. 557/926 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4301 event pairs, 113 based on Foata normal form. 64/950 useless extension candidates. Maximal degree in co-relation 1955. Up to 633 conditions per place. [2023-11-06 23:08:31,041 INFO L140 encePairwiseOnDemand]: 248/254 looper letters, 29 selfloop transitions, 4 changer transitions 19/54 dead transitions. [2023-11-06 23:08:31,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 54 transitions, 232 flow [2023-11-06 23:08:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:08:31,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:08:31,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2023-11-06 23:08:31,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519685039370079 [2023-11-06 23:08:31,046 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 574 transitions. [2023-11-06 23:08:31,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 574 transitions. [2023-11-06 23:08:31,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:31,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 574 transitions. [2023-11-06 23:08:31,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:31,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:31,057 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:31,057 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 574 transitions. [2023-11-06 23:08:31,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 54 transitions, 232 flow [2023-11-06 23:08:31,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:08:31,061 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 86 flow [2023-11-06 23:08:31,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-11-06 23:08:31,064 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-11-06 23:08:31,064 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 86 flow [2023-11-06 23:08:31,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:31,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:31,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:31,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:31,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:31,280 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:31,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1007953997, now seen corresponding path program 1 times [2023-11-06 23:08:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:08:31,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867620779] [2023-11-06 23:08:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:31,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:31,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:08:31,284 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:08:31,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 23:08:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:31,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:08:31,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:31,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:31,518 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:08:31,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:08:31,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867620779] [2023-11-06 23:08:31,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867620779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:31,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:31,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:08:31,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829545081] [2023-11-06 23:08:31,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:31,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:31,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:08:31,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:31,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:31,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 254 [2023-11-06 23:08:31,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:31,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:31,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 254 [2023-11-06 23:08:31,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:31,959 INFO L124 PetriNetUnfolderBase]: 233/440 cut-off events. [2023-11-06 23:08:31,960 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2023-11-06 23:08:31,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 440 events. 233/440 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1798 event pairs, 61 based on Foata normal form. 37/464 useless extension candidates. Maximal degree in co-relation 1169. Up to 140 conditions per place. [2023-11-06 23:08:31,965 INFO L140 encePairwiseOnDemand]: 248/254 looper letters, 37 selfloop transitions, 7 changer transitions 19/65 dead transitions. [2023-11-06 23:08:31,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 65 transitions, 336 flow [2023-11-06 23:08:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:08:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:08:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 689 transitions. [2023-11-06 23:08:31,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4520997375328084 [2023-11-06 23:08:31,970 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 689 transitions. [2023-11-06 23:08:31,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 689 transitions. [2023-11-06 23:08:31,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:31,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 689 transitions. [2023-11-06 23:08:31,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:31,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:31,982 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:31,982 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 86 flow. Second operand 6 states and 689 transitions. [2023-11-06 23:08:31,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 65 transitions, 336 flow [2023-11-06 23:08:31,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 65 transitions, 330 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 23:08:31,988 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 136 flow [2023-11-06 23:08:31,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-11-06 23:08:31,989 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-11-06 23:08:31,990 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 136 flow [2023-11-06 23:08:31,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:31,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:31,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:32,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:32,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:32,205 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:32,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:32,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1762399205, now seen corresponding path program 1 times [2023-11-06 23:08:32,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:08:32,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244369342] [2023-11-06 23:08:32,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:32,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:32,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:08:32,209 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:08:32,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 23:08:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:32,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 23:08:32,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:32,462 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:08:32,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:08:32,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244369342] [2023-11-06 23:08:32,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244369342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:32,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:32,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:08:32,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400204037] [2023-11-06 23:08:32,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:32,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:08:32,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:08:32,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:08:32,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:08:32,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 254 [2023-11-06 23:08:32,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:32,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:32,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 254 [2023-11-06 23:08:32,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:32,968 INFO L124 PetriNetUnfolderBase]: 143/278 cut-off events. [2023-11-06 23:08:32,968 INFO L125 PetriNetUnfolderBase]: For 257/257 co-relation queries the response was YES. [2023-11-06 23:08:32,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 278 events. 143/278 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1010 event pairs, 56 based on Foata normal form. 10/284 useless extension candidates. Maximal degree in co-relation 802. Up to 108 conditions per place. [2023-11-06 23:08:32,971 INFO L140 encePairwiseOnDemand]: 248/254 looper letters, 34 selfloop transitions, 10 changer transitions 10/56 dead transitions. [2023-11-06 23:08:32,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 334 flow [2023-11-06 23:08:32,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:08:32,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:08:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 784 transitions. [2023-11-06 23:08:32,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4409448818897638 [2023-11-06 23:08:32,977 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 784 transitions. [2023-11-06 23:08:32,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 784 transitions. [2023-11-06 23:08:32,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:32,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 784 transitions. [2023-11-06 23:08:32,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:32,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:32,989 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:32,989 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 136 flow. Second operand 7 states and 784 transitions. [2023-11-06 23:08:32,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 334 flow [2023-11-06 23:08:32,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 298 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-06 23:08:32,996 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 138 flow [2023-11-06 23:08:32,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-11-06 23:08:32,998 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-11-06 23:08:32,998 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 138 flow [2023-11-06 23:08:32,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:32,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:32,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:33,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:33,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:33,215 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:33,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:33,215 INFO L85 PathProgramCache]: Analyzing trace with hash -958854952, now seen corresponding path program 1 times [2023-11-06 23:08:33,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:08:33,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540771974] [2023-11-06 23:08:33,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:33,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:33,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:08:33,224 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:08:33,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 23:08:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:33,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:08:33,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:33,481 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:08:33,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:08:33,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540771974] [2023-11-06 23:08:33,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540771974] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:33,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:33,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:08:33,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272518786] [2023-11-06 23:08:33,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:33,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:08:33,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:08:33,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:08:33,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:08:33,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 254 [2023-11-06 23:08:33,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:33,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:33,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 254 [2023-11-06 23:08:33,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:33,835 INFO L124 PetriNetUnfolderBase]: 303/542 cut-off events. [2023-11-06 23:08:33,835 INFO L125 PetriNetUnfolderBase]: For 582/582 co-relation queries the response was YES. [2023-11-06 23:08:33,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1582 conditions, 542 events. 303/542 cut-off events. For 582/582 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2156 event pairs, 59 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 1572. Up to 250 conditions per place. [2023-11-06 23:08:33,841 INFO L140 encePairwiseOnDemand]: 249/254 looper letters, 55 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2023-11-06 23:08:33,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 400 flow [2023-11-06 23:08:33,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:08:33,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:08:33,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-11-06 23:08:33,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47244094488188976 [2023-11-06 23:08:33,846 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-11-06 23:08:33,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-11-06 23:08:33,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:33,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-11-06 23:08:33,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:33,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:33,853 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:33,853 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 138 flow. Second operand 4 states and 480 transitions. [2023-11-06 23:08:33,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 59 transitions, 400 flow [2023-11-06 23:08:33,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 59 transitions, 324 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-11-06 23:08:33,860 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 128 flow [2023-11-06 23:08:33,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-11-06 23:08:33,864 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-11-06 23:08:33,864 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 128 flow [2023-11-06 23:08:33,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:33,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:33,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:33,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:34,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:34,079 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:34,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:34,080 INFO L85 PathProgramCache]: Analyzing trace with hash 415190704, now seen corresponding path program 2 times [2023-11-06 23:08:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:08:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815004884] [2023-11-06 23:08:34,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:08:34,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:34,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:08:34,083 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:08:34,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 23:08:34,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 23:08:34,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:08:34,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:08:34,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:34,337 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:08:34,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:08:34,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815004884] [2023-11-06 23:08:34,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815004884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:34,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:34,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:08:34,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289819282] [2023-11-06 23:08:34,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:34,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:08:34,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:08:34,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:08:34,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:08:34,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 254 [2023-11-06 23:08:34,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:34,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:34,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 254 [2023-11-06 23:08:34,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:34,673 INFO L124 PetriNetUnfolderBase]: 398/729 cut-off events. [2023-11-06 23:08:34,673 INFO L125 PetriNetUnfolderBase]: For 529/529 co-relation queries the response was YES. [2023-11-06 23:08:34,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2179 conditions, 729 events. 398/729 cut-off events. For 529/529 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3197 event pairs, 126 based on Foata normal form. 1/730 useless extension candidates. Maximal degree in co-relation 2170. Up to 440 conditions per place. [2023-11-06 23:08:34,681 INFO L140 encePairwiseOnDemand]: 249/254 looper letters, 51 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2023-11-06 23:08:34,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 333 flow [2023-11-06 23:08:34,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:08:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:08:34,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2023-11-06 23:08:34,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.468503937007874 [2023-11-06 23:08:34,685 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2023-11-06 23:08:34,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2023-11-06 23:08:34,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:34,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2023-11-06 23:08:34,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:34,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:34,692 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:34,692 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 128 flow. Second operand 4 states and 476 transitions. [2023-11-06 23:08:34,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 333 flow [2023-11-06 23:08:34,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:08:34,701 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 143 flow [2023-11-06 23:08:34,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-11-06 23:08:34,702 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-11-06 23:08:34,703 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 143 flow [2023-11-06 23:08:34,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:34,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:34,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:34,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:34,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:34,921 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:34,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:34,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1345725474, now seen corresponding path program 3 times [2023-11-06 23:08:34,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:08:34,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575609688] [2023-11-06 23:08:34,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:08:34,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:34,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:08:34,925 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:08:34,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 23:08:35,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 23:08:35,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:08:35,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:08:35,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:35,173 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:08:35,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:08:35,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575609688] [2023-11-06 23:08:35,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575609688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:35,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:35,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:35,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236476548] [2023-11-06 23:08:35,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:35,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:08:35,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:08:35,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:08:35,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:08:35,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 254 [2023-11-06 23:08:35,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 143 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:35,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:35,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 254 [2023-11-06 23:08:35,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:35,678 INFO L124 PetriNetUnfolderBase]: 545/1040 cut-off events. [2023-11-06 23:08:35,678 INFO L125 PetriNetUnfolderBase]: For 920/920 co-relation queries the response was YES. [2023-11-06 23:08:35,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3130 conditions, 1040 events. 545/1040 cut-off events. For 920/920 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5436 event pairs, 144 based on Foata normal form. 1/1041 useless extension candidates. Maximal degree in co-relation 3120. Up to 467 conditions per place. [2023-11-06 23:08:35,690 INFO L140 encePairwiseOnDemand]: 250/254 looper letters, 82 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2023-11-06 23:08:35,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 87 transitions, 546 flow [2023-11-06 23:08:35,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:08:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:08:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2023-11-06 23:08:35,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47401574803149604 [2023-11-06 23:08:35,694 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2023-11-06 23:08:35,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2023-11-06 23:08:35,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:35,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2023-11-06 23:08:35,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:35,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:35,703 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:35,703 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 143 flow. Second operand 5 states and 602 transitions. [2023-11-06 23:08:35,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 87 transitions, 546 flow [2023-11-06 23:08:35,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 87 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:08:35,716 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 165 flow [2023-11-06 23:08:35,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2023-11-06 23:08:35,720 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-11-06 23:08:35,724 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 165 flow [2023-11-06 23:08:35,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:35,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:35,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:35,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:35,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:35,940 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:35,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:35,946 INFO L85 PathProgramCache]: Analyzing trace with hash 244435470, now seen corresponding path program 4 times [2023-11-06 23:08:35,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:08:35,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406415051] [2023-11-06 23:08:35,948 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 23:08:35,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:35,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:08:35,949 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:08:35,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 23:08:36,123 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 23:08:36,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:08:36,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 23:08:36,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:08:36,568 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:08:36,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:08:36,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406415051] [2023-11-06 23:08:36,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406415051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:36,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:36,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:08:36,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869881816] [2023-11-06 23:08:36,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:36,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:08:36,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:08:36,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:08:36,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:08:36,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 254 [2023-11-06 23:08:36,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 165 flow. Second operand has 7 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:36,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:36,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 254 [2023-11-06 23:08:36,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:37,287 INFO L124 PetriNetUnfolderBase]: 539/1168 cut-off events. [2023-11-06 23:08:37,287 INFO L125 PetriNetUnfolderBase]: For 1208/1208 co-relation queries the response was YES. [2023-11-06 23:08:37,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3663 conditions, 1168 events. 539/1168 cut-off events. For 1208/1208 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7437 event pairs, 42 based on Foata normal form. 1/1168 useless extension candidates. Maximal degree in co-relation 3651. Up to 487 conditions per place. [2023-11-06 23:08:37,300 INFO L140 encePairwiseOnDemand]: 248/254 looper letters, 62 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2023-11-06 23:08:37,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 474 flow [2023-11-06 23:08:37,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:08:37,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:08:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 797 transitions. [2023-11-06 23:08:37,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482564679415073 [2023-11-06 23:08:37,305 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 797 transitions. [2023-11-06 23:08:37,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 797 transitions. [2023-11-06 23:08:37,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:37,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 797 transitions. [2023-11-06 23:08:37,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:37,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:37,316 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:37,316 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 165 flow. Second operand 7 states and 797 transitions. [2023-11-06 23:08:37,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 474 flow [2023-11-06 23:08:37,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 467 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-06 23:08:37,337 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 182 flow [2023-11-06 23:08:37,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2023-11-06 23:08:37,338 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2023-11-06 23:08:37,338 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 182 flow [2023-11-06 23:08:37,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:37,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:37,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:37,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:37,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:37,552 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:08:37,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:37,553 INFO L85 PathProgramCache]: Analyzing trace with hash 954937866, now seen corresponding path program 5 times [2023-11-06 23:08:37,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:08:37,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738495719] [2023-11-06 23:08:37,554 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 23:08:37,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:37,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:08:37,556 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:08:37,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 23:08:37,781 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 23:08:37,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 23:08:37,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:08:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:08:37,966 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 23:08:37,973 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:08:37,975 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 23:08:37,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 23:08:37,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 23:08:37,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 23:08:37,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 23:08:37,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 23:08:37,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 23:08:37,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 23:08:37,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 23:08:37,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 23:08:37,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 23:08:37,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 23:08:37,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 23:08:38,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:38,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:08:38,204 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2023-11-06 23:08:38,209 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:08:38,210 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:08:38,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:08:38 BasicIcfg [2023-11-06 23:08:38,299 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:08:38,300 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:08:38,300 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:08:38,300 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:08:38,301 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:16" (3/4) ... [2023-11-06 23:08:38,303 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:08:38,304 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:08:38,305 INFO L158 Benchmark]: Toolchain (without parser) took 24158.88ms. Allocated memory was 67.1MB in the beginning and 159.4MB in the end (delta: 92.3MB). Free memory was 42.2MB in the beginning and 64.2MB in the end (delta: -21.9MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. [2023-11-06 23:08:38,306 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 67.1MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:08:38,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1004.76ms. Allocated memory was 67.1MB in the beginning and 90.2MB in the end (delta: 23.1MB). Free memory was 42.1MB in the beginning and 56.6MB in the end (delta: -14.5MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2023-11-06 23:08:38,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.28ms. Allocated memory is still 90.2MB. Free memory was 56.6MB in the beginning and 53.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:08:38,307 INFO L158 Benchmark]: Boogie Preprocessor took 97.63ms. Allocated memory is still 90.2MB. Free memory was 53.8MB in the beginning and 51.8MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:08:38,308 INFO L158 Benchmark]: RCFGBuilder took 1199.52ms. Allocated memory is still 90.2MB. Free memory was 51.8MB in the beginning and 33.1MB in the end (delta: 18.7MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2023-11-06 23:08:38,308 INFO L158 Benchmark]: TraceAbstraction took 21722.48ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 32.5MB in the beginning and 64.2MB in the end (delta: -31.7MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2023-11-06 23:08:38,309 INFO L158 Benchmark]: Witness Printer took 4.75ms. Allocated memory is still 159.4MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:08:38,311 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.34ms. Allocated memory is still 67.1MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1004.76ms. Allocated memory was 67.1MB in the beginning and 90.2MB in the end (delta: 23.1MB). Free memory was 42.1MB in the beginning and 56.6MB in the end (delta: -14.5MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.28ms. Allocated memory is still 90.2MB. Free memory was 56.6MB in the beginning and 53.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 97.63ms. Allocated memory is still 90.2MB. Free memory was 53.8MB in the beginning and 51.8MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1199.52ms. Allocated memory is still 90.2MB. Free memory was 51.8MB in the beginning and 33.1MB in the end (delta: 18.7MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21722.48ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 32.5MB in the beginning and 64.2MB in the end (delta: -31.7MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * Witness Printer took 4.75ms. Allocated memory is still 159.4MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.1s, 130 PlacesBefore, 40 PlacesAfterwards, 123 TransitionsBefore, 31 TransitionsAfterwards, 2374 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 128 TotalNumberOfCompositions, 5999 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2479, independent: 2305, independent conditional: 0, independent unconditional: 2305, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1268, independent: 1234, independent conditional: 0, independent unconditional: 1234, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2479, independent: 1071, independent conditional: 0, independent unconditional: 1071, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 1268, unknown conditional: 0, unknown unconditional: 1268] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1828, ((void *)0), P0, ((void *)0))=0, t1828={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1829, ((void *)0), P1, ((void *)0))=1, t1828={3:0}, t1829={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1830, ((void *)0), P2, ((void *)0))=2, t1828={3:0}, t1829={7:0}, t1830={15:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 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) [L752] 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)) [L753] 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)) [L754] 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)) [L755] 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)) [L756] 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)) [L757] 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)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L787] 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) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 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 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 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 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={3:0}, t1829={7:0}, t1830={15:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe002_power.opt_pso.oepc_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={5:6}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=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: -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: 827]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 830]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 250 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1048 IncrementalHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 23 mSDtfsCounter, 1048 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=9, 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.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 467 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1079 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 23:08:38,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56dfa707-cc64-4eb4-b2d5-2503d538c0d5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample