./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011.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_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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 bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:00:18,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:00:18,420 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 23:00:18,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:00:18,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:00:18,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:00:18,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:00:18,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:00:18,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:00:18,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:00:18,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:00:18,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:00:18,460 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:00:18,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:00:18,462 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:00:18,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:00:18,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:00:18,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:00:18,464 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:00:18,464 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:00:18,464 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:00:18,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:00:18,465 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:00:18,466 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:00:18,466 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:00:18,466 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:00:18,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:00:18,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:00:18,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:00:18,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:00:18,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:00:18,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:00:18,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:00:18,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:00:18,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:00:18,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:00:18,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:00:18,471 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:00:18,471 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_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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 -> bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c [2023-11-06 23:00:18,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:00:18,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:00:18,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:00:18,771 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:00:18,773 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:00:18,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix011.opt.i [2023-11-06 23:00:21,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:00:22,164 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:00:22,175 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/sv-benchmarks/c/pthread-wmm/mix011.opt.i [2023-11-06 23:00:22,192 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/data/e2d757e77/d8559dbf9d304868afb1c90c4b0c7c9d/FLAGb1ae3ceb2 [2023-11-06 23:00:22,207 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/data/e2d757e77/d8559dbf9d304868afb1c90c4b0c7c9d [2023-11-06 23:00:22,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:00:22,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:00:22,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:00:22,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:00:22,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:00:22,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:00:22" (1/1) ... [2023-11-06 23:00:22,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e6dc14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:22, skipping insertion in model container [2023-11-06 23:00:22,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:00:22" (1/1) ... [2023-11-06 23:00:22,300 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:00:22,801 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:00:22,821 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:00:22,918 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:00:22,986 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:00:22,986 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:00:22,994 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:00:22,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:22 WrapperNode [2023-11-06 23:00:22,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:00:22,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:00:22,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:00:22,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:00:23,004 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:00:22" (1/1) ... [2023-11-06 23:00:23,021 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:00:22" (1/1) ... [2023-11-06 23:00:23,079 INFO L138 Inliner]: procedures = 176, calls = 61, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156 [2023-11-06 23:00:23,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:00:23,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:00:23,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:00:23,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:00:23,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:22" (1/1) ... [2023-11-06 23:00:23,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:22" (1/1) ... [2023-11-06 23:00:23,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:22" (1/1) ... [2023-11-06 23:00:23,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:22" (1/1) ... [2023-11-06 23:00:23,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:22" (1/1) ... [2023-11-06 23:00:23,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:22" (1/1) ... [2023-11-06 23:00:23,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:22" (1/1) ... [2023-11-06 23:00:23,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:22" (1/1) ... [2023-11-06 23:00:23,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:00:23,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:00:23,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:00:23,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:00:23,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:22" (1/1) ... [2023-11-06 23:00:23,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:00:23,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:23,184 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:00:23,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:00:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:00:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:00:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:00:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:00:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:00:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:00:23,234 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:00:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:00:23,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:00:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:00:23,236 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:00:23,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:00:23,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:00:23,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:00:23,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:00:23,240 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:00:23,393 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:00:23,394 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:00:23,777 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:00:24,005 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:00:24,008 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:00:24,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:00:24 BoogieIcfgContainer [2023-11-06 23:00:24,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:00:24,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:00:24,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:00:24,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:00:24,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:00:22" (1/3) ... [2023-11-06 23:00:24,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a42c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:00:24, skipping insertion in model container [2023-11-06 23:00:24,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:22" (2/3) ... [2023-11-06 23:00:24,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a42c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:00:24, skipping insertion in model container [2023-11-06 23:00:24,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:00:24" (3/3) ... [2023-11-06 23:00:24,028 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011.opt.i [2023-11-06 23:00:24,049 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:00:24,049 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 23:00:24,050 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:00:24,144 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:00:24,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 130 transitions, 272 flow [2023-11-06 23:00:24,296 INFO L124 PetriNetUnfolderBase]: 3/127 cut-off events. [2023-11-06 23:00:24,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:00:24,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 3/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-11-06 23:00:24,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 130 transitions, 272 flow [2023-11-06 23:00:24,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 127 transitions, 263 flow [2023-11-06 23:00:24,318 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:00:24,336 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 127 transitions, 263 flow [2023-11-06 23:00:24,339 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 127 transitions, 263 flow [2023-11-06 23:00:24,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 127 transitions, 263 flow [2023-11-06 23:00:24,373 INFO L124 PetriNetUnfolderBase]: 3/127 cut-off events. [2023-11-06 23:00:24,373 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:00:24,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 3/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-11-06 23:00:24,377 INFO L119 LiptonReduction]: Number of co-enabled transitions 2594 [2023-11-06 23:00:29,607 INFO L134 LiptonReduction]: Checked pairs total: 6567 [2023-11-06 23:00:29,607 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-11-06 23:00:29,623 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:00:29,630 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;@5ddd403e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:00:29,631 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 23:00:29,632 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:00:29,633 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:00:29,633 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:00:29,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:29,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:00:29,634 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:00:29,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:29,640 INFO L85 PathProgramCache]: Analyzing trace with hash 600, now seen corresponding path program 1 times [2023-11-06 23:00:29,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:29,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708207202] [2023-11-06 23:00:29,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:29,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:29,786 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:00:29,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:29,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708207202] [2023-11-06 23:00:29,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708207202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:29,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:29,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:00:29,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62743757] [2023-11-06 23:00:29,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:29,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:00:29,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:29,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:00:29,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:00:29,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 261 [2023-11-06 23:00:29,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states 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:00:29,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:29,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 261 [2023-11-06 23:00:29,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:30,464 INFO L124 PetriNetUnfolderBase]: 1615/2434 cut-off events. [2023-11-06 23:00:30,470 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-06 23:00:30,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4849 conditions, 2434 events. 1615/2434 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11873 event pairs, 1615 based on Foata normal form. 90/2118 useless extension candidates. Maximal degree in co-relation 4838. Up to 2373 conditions per place. [2023-11-06 23:00:30,497 INFO L140 encePairwiseOnDemand]: 254/261 looper letters, 24 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-11-06 23:00:30,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 109 flow [2023-11-06 23:00:30,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:00:30,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:00:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 265 transitions. [2023-11-06 23:00:30,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076628352490421 [2023-11-06 23:00:30,515 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 265 transitions. [2023-11-06 23:00:30,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 265 transitions. [2023-11-06 23:00:30,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:30,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 265 transitions. [2023-11-06 23:00:30,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states 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:00:30,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states 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:00:30,530 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states 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:00:30,532 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 265 transitions. [2023-11-06 23:00:30,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 109 flow [2023-11-06 23:00:30,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:00:30,538 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-11-06 23:00:30,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-11-06 23:00:30,544 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-11-06 23:00:30,544 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-11-06 23:00:30,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states 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:00:30,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:30,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:30,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:00:30,546 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:00:30,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:30,547 INFO L85 PathProgramCache]: Analyzing trace with hash 988047205, now seen corresponding path program 1 times [2023-11-06 23:00:30,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:30,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006987798] [2023-11-06 23:00:30,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:30,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:30,951 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:00:30,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:30,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006987798] [2023-11-06 23:00:30,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006987798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:30,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:30,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:00:30,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901115248] [2023-11-06 23:00:30,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:30,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:00:30,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:30,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:00:30,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:00:30,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 261 [2023-11-06 23:00:30,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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:00:30,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:30,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 261 [2023-11-06 23:00:30,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:31,322 INFO L124 PetriNetUnfolderBase]: 1334/2093 cut-off events. [2023-11-06 23:00:31,323 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:00:31,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4105 conditions, 2093 events. 1334/2093 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10657 event pairs, 210 based on Foata normal form. 0/1867 useless extension candidates. Maximal degree in co-relation 4102. Up to 1605 conditions per place. [2023-11-06 23:00:31,337 INFO L140 encePairwiseOnDemand]: 258/261 looper letters, 30 selfloop transitions, 2 changer transitions 4/38 dead transitions. [2023-11-06 23:00:31,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 154 flow [2023-11-06 23:00:31,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:00:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:00:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-11-06 23:00:31,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49169859514687103 [2023-11-06 23:00:31,342 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-11-06 23:00:31,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-11-06 23:00:31,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:31,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-11-06 23:00:31,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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:00:31,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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:00:31,349 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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:00:31,349 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 385 transitions. [2023-11-06 23:00:31,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 154 flow [2023-11-06 23:00:31,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:00:31,351 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2023-11-06 23:00:31,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-11-06 23:00:31,352 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-11-06 23:00:31,353 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 56 flow [2023-11-06 23:00:31,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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:00:31,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:31,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:31,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:00:31,354 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:00:31,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:31,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1505615902, now seen corresponding path program 1 times [2023-11-06 23:00:31,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:31,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615268804] [2023-11-06 23:00:31,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:31,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:31,617 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:00:31,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:31,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615268804] [2023-11-06 23:00:31,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615268804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:31,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:31,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:00:31,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632292923] [2023-11-06 23:00:31,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:31,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:31,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:31,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:31,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:00:31,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 261 [2023-11-06 23:00:31,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states 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:00:31,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:31,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 261 [2023-11-06 23:00:31,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:32,112 INFO L124 PetriNetUnfolderBase]: 1558/2291 cut-off events. [2023-11-06 23:00:32,112 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2023-11-06 23:00:32,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4769 conditions, 2291 events. 1558/2291 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10226 event pairs, 547 based on Foata normal form. 0/2197 useless extension candidates. Maximal degree in co-relation 4765. Up to 1947 conditions per place. [2023-11-06 23:00:32,132 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 48 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2023-11-06 23:00:32,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 57 transitions, 246 flow [2023-11-06 23:00:32,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:00:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:00:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2023-11-06 23:00:32,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4735632183908046 [2023-11-06 23:00:32,137 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 618 transitions. [2023-11-06 23:00:32,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 618 transitions. [2023-11-06 23:00:32,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:32,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 618 transitions. [2023-11-06 23:00:32,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states 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:00:32,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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:00:32,147 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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:00:32,147 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 56 flow. Second operand 5 states and 618 transitions. [2023-11-06 23:00:32,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 57 transitions, 246 flow [2023-11-06 23:00:32,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 57 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:00:32,150 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 110 flow [2023-11-06 23:00:32,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-11-06 23:00:32,151 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2023-11-06 23:00:32,151 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 110 flow [2023-11-06 23:00:32,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states 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:00:32,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:32,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:32,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:00:32,153 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:00:32,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1505615937, now seen corresponding path program 1 times [2023-11-06 23:00:32,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:32,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239807232] [2023-11-06 23:00:32,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:32,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:32,730 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:00:32,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:32,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239807232] [2023-11-06 23:00:32,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239807232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:32,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:32,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:00:32,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609672716] [2023-11-06 23:00:32,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:32,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:00:32,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:32,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:00:32,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:00:32,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 261 [2023-11-06 23:00:32,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 110 flow. Second operand has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states 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:00:32,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:32,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 261 [2023-11-06 23:00:32,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:33,401 INFO L124 PetriNetUnfolderBase]: 1098/1808 cut-off events. [2023-11-06 23:00:33,401 INFO L125 PetriNetUnfolderBase]: For 673/675 co-relation queries the response was YES. [2023-11-06 23:00:33,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4090 conditions, 1808 events. 1098/1808 cut-off events. For 673/675 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9099 event pairs, 108 based on Foata normal form. 184/1992 useless extension candidates. Maximal degree in co-relation 4083. Up to 1022 conditions per place. [2023-11-06 23:00:33,417 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 37 selfloop transitions, 4 changer transitions 5/49 dead transitions. [2023-11-06 23:00:33,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 257 flow [2023-11-06 23:00:33,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:00:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:00:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 652 transitions. [2023-11-06 23:00:33,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4163473818646232 [2023-11-06 23:00:33,421 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 652 transitions. [2023-11-06 23:00:33,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 652 transitions. [2023-11-06 23:00:33,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:33,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 652 transitions. [2023-11-06 23:00:33,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:33,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states 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:00:33,431 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states 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:00:33,431 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 110 flow. Second operand 6 states and 652 transitions. [2023-11-06 23:00:33,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 257 flow [2023-11-06 23:00:33,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:00:33,437 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 82 flow [2023-11-06 23:00:33,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2023-11-06 23:00:33,439 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2023-11-06 23:00:33,439 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 82 flow [2023-11-06 23:00:33,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states 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:00:33,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:33,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:33,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:00:33,441 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:00:33,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:33,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1235697532, now seen corresponding path program 1 times [2023-11-06 23:00:33,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:33,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741581453] [2023-11-06 23:00:33,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:33,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:33,634 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:00:33,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:33,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741581453] [2023-11-06 23:00:33,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741581453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:33,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:33,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:00:33,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085892428] [2023-11-06 23:00:33,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:33,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:33,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:33,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:33,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:00:33,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 261 [2023-11-06 23:00:33,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states 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:00:33,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:33,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 261 [2023-11-06 23:00:33,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:33,990 INFO L124 PetriNetUnfolderBase]: 980/1542 cut-off events. [2023-11-06 23:00:33,990 INFO L125 PetriNetUnfolderBase]: For 628/628 co-relation queries the response was YES. [2023-11-06 23:00:33,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3608 conditions, 1542 events. 980/1542 cut-off events. For 628/628 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7248 event pairs, 270 based on Foata normal form. 90/1631 useless extension candidates. Maximal degree in co-relation 3601. Up to 951 conditions per place. [2023-11-06 23:00:34,003 INFO L140 encePairwiseOnDemand]: 257/261 looper letters, 29 selfloop transitions, 2 changer transitions 17/51 dead transitions. [2023-11-06 23:00:34,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 248 flow [2023-11-06 23:00:34,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:00:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:00:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2023-11-06 23:00:34,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4704980842911877 [2023-11-06 23:00:34,007 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2023-11-06 23:00:34,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2023-11-06 23:00:34,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:34,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2023-11-06 23:00:34,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states 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:00:34,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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:00:34,015 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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:00:34,015 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 82 flow. Second operand 5 states and 614 transitions. [2023-11-06 23:00:34,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 248 flow [2023-11-06 23:00:34,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 230 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-11-06 23:00:34,022 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 83 flow [2023-11-06 23:00:34,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=83, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2023-11-06 23:00:34,023 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2023-11-06 23:00:34,024 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 83 flow [2023-11-06 23:00:34,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states 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:00:34,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:34,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:34,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:00:34,025 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:00:34,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:34,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1837446625, now seen corresponding path program 1 times [2023-11-06 23:00:34,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:34,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995766500] [2023-11-06 23:00:34,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:34,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:34,148 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:00:34,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:34,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995766500] [2023-11-06 23:00:34,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995766500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:34,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:34,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:00:34,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048766080] [2023-11-06 23:00:34,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:34,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:34,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:34,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:34,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:00:34,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2023-11-06 23:00:34,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:34,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:34,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2023-11-06 23:00:34,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:34,448 INFO L124 PetriNetUnfolderBase]: 819/1352 cut-off events. [2023-11-06 23:00:34,448 INFO L125 PetriNetUnfolderBase]: For 680/681 co-relation queries the response was YES. [2023-11-06 23:00:34,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3218 conditions, 1352 events. 819/1352 cut-off events. For 680/681 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6162 event pairs, 280 based on Foata normal form. 60/1411 useless extension candidates. Maximal degree in co-relation 3209. Up to 724 conditions per place. [2023-11-06 23:00:34,459 INFO L140 encePairwiseOnDemand]: 257/261 looper letters, 28 selfloop transitions, 2 changer transitions 13/46 dead transitions. [2023-11-06 23:00:34,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 225 flow [2023-11-06 23:00:34,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:00:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:00:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2023-11-06 23:00:34,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697318007662835 [2023-11-06 23:00:34,462 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 613 transitions. [2023-11-06 23:00:34,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 613 transitions. [2023-11-06 23:00:34,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:34,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 613 transitions. [2023-11-06 23:00:34,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states 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:00:34,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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:00:34,469 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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:00:34,469 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 83 flow. Second operand 5 states and 613 transitions. [2023-11-06 23:00:34,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 225 flow [2023-11-06 23:00:34,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 215 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-06 23:00:34,475 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 87 flow [2023-11-06 23:00:34,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2023-11-06 23:00:34,476 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-11-06 23:00:34,477 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 87 flow [2023-11-06 23:00:34,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:34,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:34,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:34,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:00:34,478 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:00:34,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:34,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2008819883, now seen corresponding path program 1 times [2023-11-06 23:00:34,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:34,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184327581] [2023-11-06 23:00:34,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:34,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:34,630 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:00:34,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:34,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184327581] [2023-11-06 23:00:34,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184327581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:34,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:34,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:00:34,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098152963] [2023-11-06 23:00:34,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:34,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:00:34,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:34,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:00:34,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:00:34,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 261 [2023-11-06 23:00:34,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states 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:00:34,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:34,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 261 [2023-11-06 23:00:34,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:34,806 INFO L124 PetriNetUnfolderBase]: 411/714 cut-off events. [2023-11-06 23:00:34,806 INFO L125 PetriNetUnfolderBase]: For 245/246 co-relation queries the response was YES. [2023-11-06 23:00:34,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1823 conditions, 714 events. 411/714 cut-off events. For 245/246 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2974 event pairs, 115 based on Foata normal form. 44/756 useless extension candidates. Maximal degree in co-relation 1813. Up to 550 conditions per place. [2023-11-06 23:00:34,823 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 32 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2023-11-06 23:00:34,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 202 flow [2023-11-06 23:00:34,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:00:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:00:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-11-06 23:00:34,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4776500638569604 [2023-11-06 23:00:34,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-11-06 23:00:34,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-11-06 23:00:34,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:34,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-11-06 23:00:34,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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:00:34,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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:00:34,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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:00:34,831 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 87 flow. Second operand 3 states and 374 transitions. [2023-11-06 23:00:34,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 202 flow [2023-11-06 23:00:34,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 192 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-06 23:00:34,834 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 105 flow [2023-11-06 23:00:34,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-11-06 23:00:34,835 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-11-06 23:00:34,836 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 105 flow [2023-11-06 23:00:34,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states 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:00:34,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:34,836 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:00:34,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:00:34,837 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:00:34,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:34,837 INFO L85 PathProgramCache]: Analyzing trace with hash 962089279, now seen corresponding path program 1 times [2023-11-06 23:00:34,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:34,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291255160] [2023-11-06 23:00:34,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:34,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:35,112 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:00:35,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:35,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291255160] [2023-11-06 23:00:35,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291255160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:35,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:35,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:00:35,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753042659] [2023-11-06 23:00:35,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:35,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:35,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:35,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:35,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:00:35,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 261 [2023-11-06 23:00:35,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:35,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:35,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 261 [2023-11-06 23:00:35,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:35,271 INFO L124 PetriNetUnfolderBase]: 203/396 cut-off events. [2023-11-06 23:00:35,271 INFO L125 PetriNetUnfolderBase]: For 102/103 co-relation queries the response was YES. [2023-11-06 23:00:35,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 396 events. 203/396 cut-off events. For 102/103 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1505 event pairs, 74 based on Foata normal form. 39/433 useless extension candidates. Maximal degree in co-relation 1129. Up to 141 conditions per place. [2023-11-06 23:00:35,275 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 41 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-11-06 23:00:35,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 273 flow [2023-11-06 23:00:35,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:00:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:00:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2023-11-06 23:00:35,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4779693486590038 [2023-11-06 23:00:35,278 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2023-11-06 23:00:35,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2023-11-06 23:00:35,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:35,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2023-11-06 23:00:35,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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:00:35,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states 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:00:35,284 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states 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:00:35,284 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 105 flow. Second operand 4 states and 499 transitions. [2023-11-06 23:00:35,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 273 flow [2023-11-06 23:00:35,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:00:35,288 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 141 flow [2023-11-06 23:00:35,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-11-06 23:00:35,292 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-11-06 23:00:35,292 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 141 flow [2023-11-06 23:00:35,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:00:35,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:35,293 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:00:35,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:00:35,293 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:00:35,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:35,299 INFO L85 PathProgramCache]: Analyzing trace with hash 652744280, now seen corresponding path program 1 times [2023-11-06 23:00:35,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:35,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899501480] [2023-11-06 23:00:35,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:35,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:35,600 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:00:35,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:35,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899501480] [2023-11-06 23:00:35,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899501480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:35,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:35,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:00:35,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768377919] [2023-11-06 23:00:35,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:35,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:00:35,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:35,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:00:35,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:00:35,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 261 [2023-11-06 23:00:35,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states 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:00:35,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:35,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 261 [2023-11-06 23:00:35,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:35,778 INFO L124 PetriNetUnfolderBase]: 169/326 cut-off events. [2023-11-06 23:00:35,779 INFO L125 PetriNetUnfolderBase]: For 300/301 co-relation queries the response was YES. [2023-11-06 23:00:35,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 326 events. 169/326 cut-off events. For 300/301 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1231 event pairs, 70 based on Foata normal form. 11/335 useless extension candidates. Maximal degree in co-relation 985. Up to 141 conditions per place. [2023-11-06 23:00:35,782 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 38 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2023-11-06 23:00:35,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 297 flow [2023-11-06 23:00:35,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:00:35,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:00:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-11-06 23:00:35,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4689655172413793 [2023-11-06 23:00:35,785 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-11-06 23:00:35,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-11-06 23:00:35,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:35,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-11-06 23:00:35,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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:00:35,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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:00:35,792 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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:00:35,792 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 141 flow. Second operand 5 states and 612 transitions. [2023-11-06 23:00:35,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 297 flow [2023-11-06 23:00:35,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 265 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-11-06 23:00:35,795 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 141 flow [2023-11-06 23:00:35,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-11-06 23:00:35,796 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-11-06 23:00:35,796 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 141 flow [2023-11-06 23:00:35,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states 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:00:35,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:35,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:35,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:00:35,797 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:00:35,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:35,798 INFO L85 PathProgramCache]: Analyzing trace with hash -134215828, now seen corresponding path program 1 times [2023-11-06 23:00:35,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:35,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553111606] [2023-11-06 23:00:35,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:35,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:36,030 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:00:36,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:36,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553111606] [2023-11-06 23:00:36,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553111606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:36,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:36,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:00:36,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251971034] [2023-11-06 23:00:36,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:36,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:00:36,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:36,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:00:36,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:00:36,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 261 [2023-11-06 23:00:36,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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:00:36,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:36,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 261 [2023-11-06 23:00:36,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:36,260 INFO L124 PetriNetUnfolderBase]: 262/480 cut-off events. [2023-11-06 23:00:36,261 INFO L125 PetriNetUnfolderBase]: For 610/610 co-relation queries the response was YES. [2023-11-06 23:00:36,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1438 conditions, 480 events. 262/480 cut-off events. For 610/610 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1955 event pairs, 51 based on Foata normal form. 1/481 useless extension candidates. Maximal degree in co-relation 1430. Up to 272 conditions per place. [2023-11-06 23:00:36,264 INFO L140 encePairwiseOnDemand]: 257/261 looper letters, 35 selfloop transitions, 1 changer transitions 24/62 dead transitions. [2023-11-06 23:00:36,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 418 flow [2023-11-06 23:00:36,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:00:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:00:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2023-11-06 23:00:36,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45977011494252873 [2023-11-06 23:00:36,268 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 600 transitions. [2023-11-06 23:00:36,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 600 transitions. [2023-11-06 23:00:36,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:36,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 600 transitions. [2023-11-06 23:00:36,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states 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:00:36,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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:00:36,274 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states 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:00:36,274 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 141 flow. Second operand 5 states and 600 transitions. [2023-11-06 23:00:36,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 418 flow [2023-11-06 23:00:36,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 362 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-06 23:00:36,278 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 124 flow [2023-11-06 23:00:36,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-11-06 23:00:36,279 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-11-06 23:00:36,280 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 124 flow [2023-11-06 23:00:36,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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:00:36,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:36,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:36,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:00:36,281 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:00:36,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:36,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2066352968, now seen corresponding path program 2 times [2023-11-06 23:00:36,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:36,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65514857] [2023-11-06 23:00:36,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:36,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:37,713 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:00:37,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:37,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65514857] [2023-11-06 23:00:37,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65514857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:37,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:37,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:00:37,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121278153] [2023-11-06 23:00:37,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:37,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:00:37,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:37,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:00:37,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:00:37,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 261 [2023-11-06 23:00:37,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 124 flow. Second operand has 8 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 0 states 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:00:37,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:37,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 261 [2023-11-06 23:00:37,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:38,115 INFO L124 PetriNetUnfolderBase]: 189/374 cut-off events. [2023-11-06 23:00:38,116 INFO L125 PetriNetUnfolderBase]: For 380/381 co-relation queries the response was YES. [2023-11-06 23:00:38,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 374 events. 189/374 cut-off events. For 380/381 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1416 event pairs, 64 based on Foata normal form. 1/374 useless extension candidates. Maximal degree in co-relation 1119. Up to 128 conditions per place. [2023-11-06 23:00:38,118 INFO L140 encePairwiseOnDemand]: 253/261 looper letters, 42 selfloop transitions, 6 changer transitions 19/70 dead transitions. [2023-11-06 23:00:38,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 448 flow [2023-11-06 23:00:38,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:00:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:00:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1027 transitions. [2023-11-06 23:00:38,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43720732226479353 [2023-11-06 23:00:38,124 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1027 transitions. [2023-11-06 23:00:38,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1027 transitions. [2023-11-06 23:00:38,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:38,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1027 transitions. [2023-11-06 23:00:38,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states 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:00:38,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states 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:00:38,135 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states 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:00:38,136 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 124 flow. Second operand 9 states and 1027 transitions. [2023-11-06 23:00:38,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 448 flow [2023-11-06 23:00:38,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 437 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 23:00:38,140 INFO L231 Difference]: Finished difference. Result has 52 places, 31 transitions, 142 flow [2023-11-06 23:00:38,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=142, PETRI_PLACES=52, PETRI_TRANSITIONS=31} [2023-11-06 23:00:38,141 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2023-11-06 23:00:38,141 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 31 transitions, 142 flow [2023-11-06 23:00:38,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 0 states 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:00:38,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:38,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:38,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:00:38,143 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:00:38,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:38,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1713083626, now seen corresponding path program 3 times [2023-11-06 23:00:38,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:38,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878210780] [2023-11-06 23:00:38,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:38,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:00:38,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:00:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:00:38,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:00:38,323 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:00:38,324 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 23:00:38,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 23:00:38,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 23:00:38,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 23:00:38,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 23:00:38,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 23:00:38,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 23:00:38,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 23:00:38,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 23:00:38,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 23:00:38,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 23:00:38,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 23:00:38,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 23:00:38,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:00:38,329 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:38,336 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:00:38,336 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:00:38,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:00:38 BasicIcfg [2023-11-06 23:00:38,426 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:00:38,427 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:00:38,427 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:00:38,427 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:00:38,428 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:00:24" (3/4) ... [2023-11-06 23:00:38,429 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:00:38,431 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:00:38,431 INFO L158 Benchmark]: Toolchain (without parser) took 16220.20ms. Allocated memory was 146.8MB in the beginning and 308.3MB in the end (delta: 161.5MB). Free memory was 99.1MB in the beginning and 258.7MB in the end (delta: -159.5MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2023-11-06 23:00:38,432 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 104.9MB. Free memory is still 56.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:00:38,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 782.36ms. Allocated memory is still 146.8MB. Free memory was 98.9MB in the beginning and 74.9MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 23:00:38,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.51ms. Allocated memory is still 146.8MB. Free memory was 74.9MB in the beginning and 115.0MB in the end (delta: -40.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2023-11-06 23:00:38,433 INFO L158 Benchmark]: Boogie Preprocessor took 53.19ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 115.0MB in the beginning and 182.6MB in the end (delta: -67.6MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2023-11-06 23:00:38,433 INFO L158 Benchmark]: RCFGBuilder took 874.52ms. Allocated memory is still 211.8MB. Free memory was 182.6MB in the beginning and 139.8MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2023-11-06 23:00:38,434 INFO L158 Benchmark]: TraceAbstraction took 14408.60ms. Allocated memory was 211.8MB in the beginning and 308.3MB in the end (delta: 96.5MB). Free memory was 138.7MB in the beginning and 258.7MB in the end (delta: -120.0MB). Peak memory consumption was 143.1MB. Max. memory is 16.1GB. [2023-11-06 23:00:38,434 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 308.3MB. Free memory is still 258.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:00:38,436 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.30ms. Allocated memory is still 104.9MB. Free memory is still 56.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 782.36ms. Allocated memory is still 146.8MB. Free memory was 98.9MB in the beginning and 74.9MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.51ms. Allocated memory is still 146.8MB. Free memory was 74.9MB in the beginning and 115.0MB in the end (delta: -40.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.19ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 115.0MB in the beginning and 182.6MB in the end (delta: -67.6MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * RCFGBuilder took 874.52ms. Allocated memory is still 211.8MB. Free memory was 182.6MB in the beginning and 139.8MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14408.60ms. Allocated memory was 211.8MB in the beginning and 308.3MB in the end (delta: 96.5MB). Free memory was 138.7MB in the beginning and 258.7MB in the end (delta: -120.0MB). Peak memory consumption was 143.1MB. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 308.3MB. Free memory is still 258.7MB. 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: 5.3s, 134 PlacesBefore, 42 PlacesAfterwards, 127 TransitionsBefore, 33 TransitionsAfterwards, 2594 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 131 TotalNumberOfCompositions, 6567 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3123, independent: 2935, independent conditional: 0, independent unconditional: 2935, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1388, independent: 1357, independent conditional: 0, independent unconditional: 1357, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3123, independent: 1578, independent conditional: 0, independent unconditional: 1578, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 1388, unknown conditional: 0, unknown unconditional: 1388] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L727] 0 int z = 0; [L728] 0 _Bool z$flush_delayed; [L729] 0 int z$mem_tmp; [L730] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd1; [L732] 0 _Bool z$r_buff0_thd2; [L733] 0 _Bool z$r_buff0_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$read_delayed; [L739] 0 int *z$read_delayed_var; [L740] 0 int z$w_buff0; [L741] 0 _Bool z$w_buff0_used; [L742] 0 int z$w_buff1; [L743] 0 _Bool z$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L851] 0 pthread_t t284; [L852] FCALL, FORK 0 pthread_create(&t284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t284, ((void *)0), P0, ((void *)0))=-2, t284={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L853] 0 pthread_t t285; [L854] FCALL, FORK 0 pthread_create(&t285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t285, ((void *)0), P1, ((void *)0))=-1, t284={5:0}, t285={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L855] 0 pthread_t t286; [L856] FCALL, FORK 0 pthread_create(&t286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t286, ((void *)0), P2, ((void *)0))=0, t284={5:0}, t285={6:0}, t286={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 3 z$w_buff1 = z$w_buff0 [L799] 3 z$w_buff0 = 1 [L800] 3 z$w_buff1_used = z$w_buff0_used [L801] 3 z$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 z$flush_delayed = weak$$choice2 [L813] 3 z$mem_tmp = z [L814] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L815] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L816] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L817] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L818] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L820] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EAX = z [L822] 3 z = z$flush_delayed ? z$mem_tmp : z [L823] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L764] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 z$flush_delayed = weak$$choice2 [L776] 2 z$mem_tmp = z [L777] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L778] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L779] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L780] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L781] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L783] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = z [L785] 2 z = z$flush_delayed ? z$mem_tmp : z [L786] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L829] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L830] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L831] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L832] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 3 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L863] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L864] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L865] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L866] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284={5:0}, t285={6:0}, t286={3:0}, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix011.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 856]: 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: 852]: 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, 157 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: 14.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 461 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 145 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1188 IncrementalHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 30 mSDtfsCounter, 1188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=11, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 884 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 23:00:38,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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 bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:00:41,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:00:41,261 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 23:00:41,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:00:41,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:00:41,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:00:41,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:00:41,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:00:41,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:00:41,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:00:41,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:00:41,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:00:41,332 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:00:41,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:00:41,335 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:00:41,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:00:41,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:00:41,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:00:41,337 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:00:41,338 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:00:41,339 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:00:41,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:00:41,340 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:00:41,340 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 23:00:41,340 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 23:00:41,341 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:00:41,341 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:00:41,342 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:00:41,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:00:41,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:00:41,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:00:41,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:00:41,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:00:41,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:00:41,346 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 23:00:41,347 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 23:00:41,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:00:41,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:00:41,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:00:41,349 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 23:00:41,349 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:00:41,350 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_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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 -> bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c [2023-11-06 23:00:41,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:00:41,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:00:41,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:00:41,817 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:00:41,817 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:00:41,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix011.opt.i [2023-11-06 23:00:44,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:00:45,445 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:00:45,451 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/sv-benchmarks/c/pthread-wmm/mix011.opt.i [2023-11-06 23:00:45,474 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/data/e038564ac/9dee3b05f8304bb18b28bf416a71ec4d/FLAG04c2528a8 [2023-11-06 23:00:45,499 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/data/e038564ac/9dee3b05f8304bb18b28bf416a71ec4d [2023-11-06 23:00:45,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:00:45,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:00:45,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:00:45,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:00:45,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:00:45,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:00:45" (1/1) ... [2023-11-06 23:00:45,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28e5c512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:45, skipping insertion in model container [2023-11-06 23:00:45,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:00:45" (1/1) ... [2023-11-06 23:00:45,592 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:00:46,083 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:00:46,104 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:00:46,218 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:00:46,278 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:00:46,278 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:00:46,286 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:00:46,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:46 WrapperNode [2023-11-06 23:00:46,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:00:46,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:00:46,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:00:46,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:00:46,299 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:00:46" (1/1) ... [2023-11-06 23:00:46,344 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:00:46" (1/1) ... [2023-11-06 23:00:46,413 INFO L138 Inliner]: procedures = 179, calls = 61, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2023-11-06 23:00:46,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:00:46,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:00:46,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:00:46,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:00:46,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:46" (1/1) ... [2023-11-06 23:00:46,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:46" (1/1) ... [2023-11-06 23:00:46,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:46" (1/1) ... [2023-11-06 23:00:46,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:46" (1/1) ... [2023-11-06 23:00:46,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:46" (1/1) ... [2023-11-06 23:00:46,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:46" (1/1) ... [2023-11-06 23:00:46,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:46" (1/1) ... [2023-11-06 23:00:46,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:46" (1/1) ... [2023-11-06 23:00:46,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:00:46,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:00:46,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:00:46,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:00:46,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:46" (1/1) ... [2023-11-06 23:00:46,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:00:46,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:46,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:00:46,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:00:46,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:00:46,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:00:46,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:00:46,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:00:46,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 23:00:46,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 23:00:46,608 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:00:46,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:00:46,609 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:00:46,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:00:46,609 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:00:46,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:00:46,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:00:46,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:00:46,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:00:46,613 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:00:46,817 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:00:46,821 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:00:47,216 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:00:47,405 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:00:47,406 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:00:47,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:00:47 BoogieIcfgContainer [2023-11-06 23:00:47,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:00:47,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:00:47,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:00:47,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:00:47,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:00:45" (1/3) ... [2023-11-06 23:00:47,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7cc20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:00:47, skipping insertion in model container [2023-11-06 23:00:47,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:46" (2/3) ... [2023-11-06 23:00:47,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7cc20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:00:47, skipping insertion in model container [2023-11-06 23:00:47,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:00:47" (3/3) ... [2023-11-06 23:00:47,420 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011.opt.i [2023-11-06 23:00:47,442 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:00:47,443 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 23:00:47,443 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:00:47,522 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:00:47,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 131 transitions, 274 flow [2023-11-06 23:00:47,642 INFO L124 PetriNetUnfolderBase]: 3/128 cut-off events. [2023-11-06 23:00:47,642 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:00:47,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 3/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-11-06 23:00:47,649 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 131 transitions, 274 flow [2023-11-06 23:00:47,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 128 transitions, 265 flow [2023-11-06 23:00:47,659 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:00:47,682 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 128 transitions, 265 flow [2023-11-06 23:00:47,691 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 128 transitions, 265 flow [2023-11-06 23:00:47,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 128 transitions, 265 flow [2023-11-06 23:00:47,757 INFO L124 PetriNetUnfolderBase]: 3/128 cut-off events. [2023-11-06 23:00:47,757 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:00:47,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 3/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-11-06 23:00:47,764 INFO L119 LiptonReduction]: Number of co-enabled transitions 2594 [2023-11-06 23:00:57,375 INFO L134 LiptonReduction]: Checked pairs total: 5930 [2023-11-06 23:00:57,375 INFO L136 LiptonReduction]: Total number of compositions: 132 [2023-11-06 23:00:57,392 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:00:57,399 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;@7428845a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:00:57,399 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 23:00:57,401 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:00:57,401 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:00:57,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:00:57,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:57,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:00:57,403 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:00:57,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash 605, now seen corresponding path program 1 times [2023-11-06 23:00:57,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:00:57,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780606475] [2023-11-06 23:00:57,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:57,424 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:00:57,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:00:57,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:00:57,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:00:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:57,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 23:00:57,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:57,546 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:00:57,546 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:00:57,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:00:57,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780606475] [2023-11-06 23:00:57,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780606475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:57,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:57,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:00:57,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30098301] [2023-11-06 23:00:57,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:57,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:00:57,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:00:57,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:00:57,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:00:57,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 263 [2023-11-06 23:00:57,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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:00:57,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:57,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 263 [2023-11-06 23:00:57,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:58,285 INFO L124 PetriNetUnfolderBase]: 1615/2434 cut-off events. [2023-11-06 23:00:58,285 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-06 23:00:58,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4849 conditions, 2434 events. 1615/2434 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11897 event pairs, 1615 based on Foata normal form. 90/2118 useless extension candidates. Maximal degree in co-relation 4838. Up to 2373 conditions per place. [2023-11-06 23:00:58,313 INFO L140 encePairwiseOnDemand]: 256/263 looper letters, 24 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-11-06 23:00:58,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 109 flow [2023-11-06 23:00:58,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:00:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:00:58,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 267 transitions. [2023-11-06 23:00:58,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076045627376425 [2023-11-06 23:00:58,337 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 267 transitions. [2023-11-06 23:00:58,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 267 transitions. [2023-11-06 23:00:58,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:58,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 267 transitions. [2023-11-06 23:00:58,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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:00:58,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 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:00:58,359 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 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:00:58,361 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 267 transitions. [2023-11-06 23:00:58,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 109 flow [2023-11-06 23:00:58,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:00:58,367 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-11-06 23:00:58,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-11-06 23:00:58,374 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-11-06 23:00:58,375 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-11-06 23:00:58,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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:00:58,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:58,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:58,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:00:58,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:00:58,587 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:00:58,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash -591698135, now seen corresponding path program 1 times [2023-11-06 23:00:58,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:00:58,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059870516] [2023-11-06 23:00:58,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:58,589 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:00:58,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:00:58,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:00:58,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:00:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:58,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:00:58,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:58,884 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:00:58,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:00:58,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:00:58,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059870516] [2023-11-06 23:00:58,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059870516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:58,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:58,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:00:58,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529579895] [2023-11-06 23:00:58,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:58,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:00:58,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:00:58,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:00:58,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:00:58,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 263 [2023-11-06 23:00:58,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states 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:00:58,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:58,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 263 [2023-11-06 23:00:58,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:00:59,343 INFO L124 PetriNetUnfolderBase]: 1334/2093 cut-off events. [2023-11-06 23:00:59,344 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:00:59,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4105 conditions, 2093 events. 1334/2093 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10631 event pairs, 210 based on Foata normal form. 0/1867 useless extension candidates. Maximal degree in co-relation 4102. Up to 1605 conditions per place. [2023-11-06 23:00:59,358 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 30 selfloop transitions, 2 changer transitions 4/38 dead transitions. [2023-11-06 23:00:59,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 154 flow [2023-11-06 23:00:59,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:00:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:00:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-11-06 23:00:59,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4917617237008872 [2023-11-06 23:00:59,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-11-06 23:00:59,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-11-06 23:00:59,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:00:59,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-11-06 23:00:59,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states 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:00:59,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states 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:00:59,369 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states 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:00:59,369 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 388 transitions. [2023-11-06 23:00:59,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 154 flow [2023-11-06 23:00:59,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:00:59,371 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2023-11-06 23:00:59,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-11-06 23:00:59,372 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-11-06 23:00:59,372 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 56 flow [2023-11-06 23:00:59,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states 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:00:59,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:00:59,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:59,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:00:59,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:00:59,585 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:00:59,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:59,586 INFO L85 PathProgramCache]: Analyzing trace with hash -730935137, now seen corresponding path program 1 times [2023-11-06 23:00:59,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:00:59,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292903393] [2023-11-06 23:00:59,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:59,588 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:00:59,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:00:59,589 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:00:59,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:00:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:59,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 23:00:59,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:59,743 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:00:59,744 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:00:59,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:00:59,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292903393] [2023-11-06 23:00:59,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292903393] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:59,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:59,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:00:59,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454529735] [2023-11-06 23:00:59,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:59,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:00:59,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:00:59,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:00:59,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:00:59,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 263 [2023-11-06 23:00:59,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states 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:00:59,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:00:59,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 263 [2023-11-06 23:00:59,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:00,012 INFO L124 PetriNetUnfolderBase]: 514/851 cut-off events. [2023-11-06 23:01:00,012 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-06 23:01:00,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1785 conditions, 851 events. 514/851 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3638 event pairs, 116 based on Foata normal form. 32/839 useless extension candidates. Maximal degree in co-relation 1781. Up to 734 conditions per place. [2023-11-06 23:01:00,019 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 31 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2023-11-06 23:01:00,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 160 flow [2023-11-06 23:01:00,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:01:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-11-06 23:01:00,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4790874524714829 [2023-11-06 23:01:00,023 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-11-06 23:01:00,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-11-06 23:01:00,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:00,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-11-06 23:01:00,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:00,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states 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:01:00,029 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states 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:01:00,029 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 56 flow. Second operand 3 states and 378 transitions. [2023-11-06 23:01:00,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 160 flow [2023-11-06 23:01:00,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:01:00,032 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 78 flow [2023-11-06 23:01:00,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-11-06 23:01:00,033 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-11-06 23:01:00,033 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 78 flow [2023-11-06 23:01:00,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states 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:01:00,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:00,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:00,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:00,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:00,256 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:01:00,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:00,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1452625380, now seen corresponding path program 1 times [2023-11-06 23:01:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:01:00,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280170837] [2023-11-06 23:01:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:00,258 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:01:00,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:01:00,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:00,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:00,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:01:00,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:01:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:00,446 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:01:00,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:01:00,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280170837] [2023-11-06 23:01:00,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280170837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:00,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:00,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:01:00,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101898247] [2023-11-06 23:01:00,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:00,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:01:00,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:01:00,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:01:00,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:01:00,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 263 [2023-11-06 23:01:00,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:00,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:00,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 263 [2023-11-06 23:01:00,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:00,702 INFO L124 PetriNetUnfolderBase]: 194/371 cut-off events. [2023-11-06 23:01:00,702 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-06 23:01:00,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 371 events. 194/371 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1350 event pairs, 60 based on Foata normal form. 32/391 useless extension candidates. Maximal degree in co-relation 916. Up to 142 conditions per place. [2023-11-06 23:01:00,706 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 40 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2023-11-06 23:01:00,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 49 transitions, 230 flow [2023-11-06 23:01:00,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:01:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:01:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2023-11-06 23:01:00,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4790874524714829 [2023-11-06 23:01:00,710 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2023-11-06 23:01:00,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2023-11-06 23:01:00,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:00,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2023-11-06 23:01:00,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:00,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 263.0) internal successors, (1315), 5 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states 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:01:00,719 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 263.0) internal successors, (1315), 5 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states 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:01:00,719 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 78 flow. Second operand 4 states and 504 transitions. [2023-11-06 23:01:00,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 49 transitions, 230 flow [2023-11-06 23:01:00,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:01:00,723 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 114 flow [2023-11-06 23:01:00,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-11-06 23:01:00,732 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2023-11-06 23:01:00,732 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 114 flow [2023-11-06 23:01:00,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:00,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:00,733 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:01:00,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:00,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:00,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:01:00,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:00,945 INFO L85 PathProgramCache]: Analyzing trace with hash -503861307, now seen corresponding path program 1 times [2023-11-06 23:01:00,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:01:00,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515081760] [2023-11-06 23:01:00,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:00,946 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:01:00,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:01:00,948 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:00,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:01,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:01:01,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:01:01,128 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:01:01,128 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:01:01,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:01:01,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515081760] [2023-11-06 23:01:01,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515081760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:01,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:01,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:01,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127173986] [2023-11-06 23:01:01,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:01,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:01:01,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:01:01,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:01:01,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:01:01,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 263 [2023-11-06 23:01:01,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:01,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:01,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 263 [2023-11-06 23:01:01,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:01,422 INFO L124 PetriNetUnfolderBase]: 144/271 cut-off events. [2023-11-06 23:01:01,422 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2023-11-06 23:01:01,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 271 events. 144/271 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 925 event pairs, 55 based on Foata normal form. 10/279 useless extension candidates. Maximal degree in co-relation 744. Up to 112 conditions per place. [2023-11-06 23:01:01,425 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 37 selfloop transitions, 10 changer transitions 0/49 dead transitions. [2023-11-06 23:01:01,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 254 flow [2023-11-06 23:01:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:01:01,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:01:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2023-11-06 23:01:01,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4699619771863118 [2023-11-06 23:01:01,429 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 618 transitions. [2023-11-06 23:01:01,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 618 transitions. [2023-11-06 23:01:01,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:01,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 618 transitions. [2023-11-06 23:01:01,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states 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:01:01,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states 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:01:01,437 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states 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:01:01,437 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 114 flow. Second operand 5 states and 618 transitions. [2023-11-06 23:01:01,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 254 flow [2023-11-06 23:01:01,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 240 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-06 23:01:01,441 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 128 flow [2023-11-06 23:01:01,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-11-06 23:01:01,442 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-11-06 23:01:01,443 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 128 flow [2023-11-06 23:01:01,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:01,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:01,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:01,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:01,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:01,664 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:01:01,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:01,665 INFO L85 PathProgramCache]: Analyzing trace with hash -653146117, now seen corresponding path program 1 times [2023-11-06 23:01:01,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:01:01,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460525017] [2023-11-06 23:01:01,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:01,666 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:01:01,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:01:01,667 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:01,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:01,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:01:01,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:01:01,914 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:01:01,917 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:01:01,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:01:01,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460525017] [2023-11-06 23:01:01,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460525017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:01,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:01,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:01,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704519457] [2023-11-06 23:01:01,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:01,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:01:01,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:01:01,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:01:01,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:01:01,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 263 [2023-11-06 23:01:01,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states 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:01:01,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:01,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 263 [2023-11-06 23:01:01,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:02,262 INFO L124 PetriNetUnfolderBase]: 195/402 cut-off events. [2023-11-06 23:01:02,262 INFO L125 PetriNetUnfolderBase]: For 508/508 co-relation queries the response was YES. [2023-11-06 23:01:02,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 402 events. 195/402 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1737 event pairs, 27 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 1111. Up to 217 conditions per place. [2023-11-06 23:01:02,266 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 56 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2023-11-06 23:01:02,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 61 transitions, 398 flow [2023-11-06 23:01:02,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:01:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:01:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2023-11-06 23:01:02,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4615969581749049 [2023-11-06 23:01:02,270 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 607 transitions. [2023-11-06 23:01:02,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 607 transitions. [2023-11-06 23:01:02,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:02,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 607 transitions. [2023-11-06 23:01:02,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states 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:01:02,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states 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:01:02,277 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states 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:01:02,277 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 128 flow. Second operand 5 states and 607 transitions. [2023-11-06 23:01:02,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 61 transitions, 398 flow [2023-11-06 23:01:02,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 342 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-06 23:01:02,283 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 131 flow [2023-11-06 23:01:02,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-11-06 23:01:02,284 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-11-06 23:01:02,284 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 131 flow [2023-11-06 23:01:02,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states 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:01:02,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:02,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:02,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:02,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:02,498 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:01:02,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:02,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1623012855, now seen corresponding path program 2 times [2023-11-06 23:01:02,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:01:02,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268875939] [2023-11-06 23:01:02,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:01:02,500 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:01:02,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:01:02,501 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:02,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:02,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 23:01:02,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:01:02,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:01:02,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:01:02,693 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:01:02,693 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:01:02,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:01:02,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268875939] [2023-11-06 23:01:02,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268875939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:02,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:02,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:01:02,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915494054] [2023-11-06 23:01:02,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:02,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:01:02,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:01:02,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:01:02,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:01:02,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 263 [2023-11-06 23:01:02,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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:01:02,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:02,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 263 [2023-11-06 23:01:02,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:02,956 INFO L124 PetriNetUnfolderBase]: 344/652 cut-off events. [2023-11-06 23:01:02,956 INFO L125 PetriNetUnfolderBase]: For 464/464 co-relation queries the response was YES. [2023-11-06 23:01:02,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1848 conditions, 652 events. 344/652 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3002 event pairs, 147 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 1838. Up to 380 conditions per place. [2023-11-06 23:01:02,962 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 49 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2023-11-06 23:01:02,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 343 flow [2023-11-06 23:01:02,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:01:02,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:01:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-11-06 23:01:02,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.467680608365019 [2023-11-06 23:01:02,966 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-11-06 23:01:02,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-11-06 23:01:02,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:02,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-11-06 23:01:02,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:01:02,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 263.0) internal successors, (1315), 5 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states 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:01:02,972 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 263.0) internal successors, (1315), 5 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states 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:01:02,972 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 131 flow. Second operand 4 states and 492 transitions. [2023-11-06 23:01:02,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 343 flow [2023-11-06 23:01:02,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:01:02,979 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 186 flow [2023-11-06 23:01:02,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-11-06 23:01:02,980 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-11-06 23:01:02,980 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 186 flow [2023-11-06 23:01:02,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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:01:02,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:02,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:03,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:03,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:03,194 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:01:03,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:03,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1611997964, now seen corresponding path program 1 times [2023-11-06 23:01:03,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:01:03,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931637477] [2023-11-06 23:01:03,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:03,198 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:01:03,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:01:03,200 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:03,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:03,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 23:01:03,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:01:03,844 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:01:03,844 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:01:03,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:01:03,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931637477] [2023-11-06 23:01:03,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931637477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:03,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:03,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:01:03,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44277691] [2023-11-06 23:01:03,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:03,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:01:03,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:01:03,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:01:03,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:01:04,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 263 [2023-11-06 23:01:04,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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:01:04,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:04,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 263 [2023-11-06 23:01:04,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:04,326 INFO L124 PetriNetUnfolderBase]: 272/537 cut-off events. [2023-11-06 23:01:04,326 INFO L125 PetriNetUnfolderBase]: For 496/496 co-relation queries the response was YES. [2023-11-06 23:01:04,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1632 conditions, 537 events. 272/537 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2533 event pairs, 41 based on Foata normal form. 3/540 useless extension candidates. Maximal degree in co-relation 1620. Up to 462 conditions per place. [2023-11-06 23:01:04,330 INFO L140 encePairwiseOnDemand]: 259/263 looper letters, 23 selfloop transitions, 3 changer transitions 16/44 dead transitions. [2023-11-06 23:01:04,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 287 flow [2023-11-06 23:01:04,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:01:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:01:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2023-11-06 23:01:04,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40608365019011405 [2023-11-06 23:01:04,333 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2023-11-06 23:01:04,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2023-11-06 23:01:04,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:04,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2023-11-06 23:01:04,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states 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:01:04,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states 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:01:04,339 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states 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:01:04,339 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 186 flow. Second operand 5 states and 534 transitions. [2023-11-06 23:01:04,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 287 flow [2023-11-06 23:01:04,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:01:04,344 INFO L231 Difference]: Finished difference. Result has 50 places, 28 transitions, 122 flow [2023-11-06 23:01:04,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=50, PETRI_TRANSITIONS=28} [2023-11-06 23:01:04,345 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-11-06 23:01:04,345 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 28 transitions, 122 flow [2023-11-06 23:01:04,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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:01:04,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:04,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:04,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:04,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:04,559 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:01:04,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:04,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1800619079, now seen corresponding path program 3 times [2023-11-06 23:01:04,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:01:04,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022140040] [2023-11-06 23:01:04,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:01:04,561 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:01:04,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:01:04,562 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:04,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:04,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 23:01:04,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 23:01:04,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:01:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:04,932 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 23:01:04,933 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:01:04,939 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 23:01:04,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 23:01:04,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 23:01:04,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 23:01:04,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 23:01:04,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 23:01:04,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 23:01:04,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 23:01:04,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 23:01:04,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 23:01:04,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 23:01:04,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 23:01:04,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 23:01:04,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:05,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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:01:05,157 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:05,162 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:01:05,162 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:01:05,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:01:05 BasicIcfg [2023-11-06 23:01:05,251 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:01:05,251 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:01:05,251 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:01:05,252 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:01:05,252 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:00:47" (3/4) ... [2023-11-06 23:01:05,254 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:01:05,255 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:01:05,256 INFO L158 Benchmark]: Toolchain (without parser) took 19748.75ms. Allocated memory was 67.1MB in the beginning and 144.7MB in the end (delta: 77.6MB). Free memory was 41.6MB in the beginning and 40.7MB in the end (delta: 823.8kB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. [2023-11-06 23:01:05,257 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 50.3MB. Free memory was 26.4MB in the beginning and 26.3MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:01:05,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 777.26ms. Allocated memory is still 67.1MB. Free memory was 41.3MB in the beginning and 30.5MB in the end (delta: 10.8MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2023-11-06 23:01:05,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.40ms. Allocated memory is still 67.1MB. Free memory was 30.3MB in the beginning and 44.8MB in the end (delta: -14.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 23:01:05,258 INFO L158 Benchmark]: Boogie Preprocessor took 86.63ms. Allocated memory is still 67.1MB. Free memory was 44.8MB in the beginning and 42.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:01:05,259 INFO L158 Benchmark]: RCFGBuilder took 902.20ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 42.5MB in the beginning and 55.1MB in the end (delta: -12.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2023-11-06 23:01:05,259 INFO L158 Benchmark]: TraceAbstraction took 17838.43ms. Allocated memory was 81.8MB in the beginning and 144.7MB in the end (delta: 62.9MB). Free memory was 54.6MB in the beginning and 40.7MB in the end (delta: 13.9MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. [2023-11-06 23:01:05,259 INFO L158 Benchmark]: Witness Printer took 4.39ms. Allocated memory is still 144.7MB. Free memory is still 40.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:01:05,262 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.31ms. Allocated memory is still 50.3MB. Free memory was 26.4MB in the beginning and 26.3MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 777.26ms. Allocated memory is still 67.1MB. Free memory was 41.3MB in the beginning and 30.5MB in the end (delta: 10.8MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 129.40ms. Allocated memory is still 67.1MB. Free memory was 30.3MB in the beginning and 44.8MB in the end (delta: -14.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.63ms. Allocated memory is still 67.1MB. Free memory was 44.8MB in the beginning and 42.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 902.20ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 42.5MB in the beginning and 55.1MB in the end (delta: -12.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17838.43ms. Allocated memory was 81.8MB in the beginning and 144.7MB in the end (delta: 62.9MB). Free memory was 54.6MB in the beginning and 40.7MB in the end (delta: 13.9MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. * Witness Printer took 4.39ms. Allocated memory is still 144.7MB. Free memory is still 40.7MB. 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: 9.7s, 135 PlacesBefore, 42 PlacesAfterwards, 128 TransitionsBefore, 33 TransitionsAfterwards, 2594 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 132 TotalNumberOfCompositions, 5930 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2392, independent: 2233, independent conditional: 0, independent unconditional: 2233, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1344, independent: 1311, independent conditional: 0, independent unconditional: 1311, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2392, independent: 922, independent conditional: 0, independent unconditional: 922, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 1344, unknown conditional: 0, unknown unconditional: 1344] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, 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: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L727] 0 int z = 0; [L728] 0 _Bool z$flush_delayed; [L729] 0 int z$mem_tmp; [L730] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd1; [L732] 0 _Bool z$r_buff0_thd2; [L733] 0 _Bool z$r_buff0_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$read_delayed; [L739] 0 int *z$read_delayed_var; [L740] 0 int z$w_buff0; [L741] 0 _Bool z$w_buff0_used; [L742] 0 int z$w_buff1; [L743] 0 _Bool z$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L851] 0 pthread_t t284; [L852] FCALL, FORK 0 pthread_create(&t284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t284, ((void *)0), P0, ((void *)0))=0, t284={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L853] 0 pthread_t t285; [L854] FCALL, FORK 0 pthread_create(&t285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t285, ((void *)0), P1, ((void *)0))=1, t284={-6:0}, t285={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L855] 0 pthread_t t286; [L856] FCALL, FORK 0 pthread_create(&t286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t286, ((void *)0), P2, ((void *)0))=2, t284={-6:0}, t285={-10:0}, t286={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 3 z$w_buff1 = z$w_buff0 [L799] 3 z$w_buff0 = 1 [L800] 3 z$w_buff1_used = z$w_buff0_used [L801] 3 z$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 z$flush_delayed = weak$$choice2 [L813] 3 z$mem_tmp = z [L814] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L815] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L816] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L817] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L818] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L820] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EAX = z [L822] 3 z = z$flush_delayed ? z$mem_tmp : z [L823] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L764] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 z$flush_delayed = weak$$choice2 [L776] 2 z$mem_tmp = z [L777] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L778] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L779] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L780] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L781] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L783] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = z [L785] 2 z = z$flush_delayed ? z$mem_tmp : z [L786] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L829] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L830] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L831] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L832] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 3 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L863] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L864] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L865] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L866] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284={-6:0}, t285={-10:0}, t286={-2:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix011.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={5:6}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 854]: 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: 856]: 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, 158 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: 17.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 796 IncrementalHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 15 mSDtfsCounter, 796 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=7, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 920 SizeOfPredicates, 5 NumberOfNonLiveVariables, 962 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:01:05,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33488c95-5b3e-4ed9-aa9c-bfcd709c1595/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