./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/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_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/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_9bb12cd3-db6c-46a0-b58d-5880a085c94b/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 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:46:36,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:46:36,445 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:46:36,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:46:36,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:46:36,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:46:36,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:46:36,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:46:36,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:46:36,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:46:36,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:46:36,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:46:36,502 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:46:36,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:46:36,504 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:46:36,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:46:36,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:46:36,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:46:36,506 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:46:36,507 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:46:36,507 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:46:36,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:46:36,508 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:46:36,508 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:46:36,509 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:46:36,509 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:46:36,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:46:36,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:46:36,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:46:36,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:36,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:46:36,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:46:36,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:46:36,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:46:36,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:46:36,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:46:36,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:46:36,515 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:46:36,515 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_9bb12cd3-db6c-46a0-b58d-5880a085c94b/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_9bb12cd3-db6c-46a0-b58d-5880a085c94b/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 -> 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 [2023-11-06 22:46:36,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:46:36,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:46:36,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:46:36,886 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:46:36,887 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:46:36,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2023-11-06 22:46:40,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:46:40,310 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:46:40,311 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2023-11-06 22:46:40,328 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/data/f6c866f27/cb5ebcd581a64a0e9b242e9ba1ec676e/FLAG68bf087c2 [2023-11-06 22:46:40,351 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/data/f6c866f27/cb5ebcd581a64a0e9b242e9ba1ec676e [2023-11-06 22:46:40,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:46:40,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:46:40,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:46:40,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:46:40,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:46:40,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:40" (1/1) ... [2023-11-06 22:46:40,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb3f5c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:40, skipping insertion in model container [2023-11-06 22:46:40,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:40" (1/1) ... [2023-11-06 22:46:40,452 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:46:40,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:46:40,931 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:46:40,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:46:41,030 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:46:41,031 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:46:41,038 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:46:41,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:41 WrapperNode [2023-11-06 22:46:41,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:46:41,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:46:41,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:46:41,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:46:41,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:41" (1/1) ... [2023-11-06 22:46:41,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:41" (1/1) ... [2023-11-06 22:46:41,098 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 166 [2023-11-06 22:46:41,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:46:41,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:46:41,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:46:41,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:46:41,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:41" (1/1) ... [2023-11-06 22:46:41,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:41" (1/1) ... [2023-11-06 22:46:41,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:41" (1/1) ... [2023-11-06 22:46:41,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:41" (1/1) ... [2023-11-06 22:46:41,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:41" (1/1) ... [2023-11-06 22:46:41,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:41" (1/1) ... [2023-11-06 22:46:41,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:41" (1/1) ... [2023-11-06 22:46:41,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:41" (1/1) ... [2023-11-06 22:46:41,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:46:41,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:46:41,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:46:41,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:46:41,166 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:41" (1/1) ... [2023-11-06 22:46:41,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:41,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:46:41,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:46:41,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:46:41,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:46:41,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:46:41,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:46:41,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:46:41,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:46:41,288 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:46:41,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:46:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:46:41,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:46:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:46:41,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:46:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:46:41,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:46:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:46:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:46:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:46:41,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:46:41,294 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:46:41,507 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:46:41,509 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:46:41,879 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:46:42,081 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:46:42,081 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:46:42,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:42 BoogieIcfgContainer [2023-11-06 22:46:42,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:46:42,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:46:42,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:46:42,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:46:42,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:46:40" (1/3) ... [2023-11-06 22:46:42,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b73660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:42, skipping insertion in model container [2023-11-06 22:46:42,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:41" (2/3) ... [2023-11-06 22:46:42,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b73660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:42, skipping insertion in model container [2023-11-06 22:46:42,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:42" (3/3) ... [2023-11-06 22:46:42,093 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2023-11-06 22:46:42,112 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:46:42,113 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:46:42,113 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:46:42,209 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:46:42,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 149 transitions, 314 flow [2023-11-06 22:46:42,363 INFO L124 PetriNetUnfolderBase]: 3/145 cut-off events. [2023-11-06 22:46:42,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:46:42,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 3/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 120 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-06 22:46:42,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 149 transitions, 314 flow [2023-11-06 22:46:42,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 145 transitions, 302 flow [2023-11-06 22:46:42,396 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:46:42,406 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 145 transitions, 302 flow [2023-11-06 22:46:42,422 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 145 transitions, 302 flow [2023-11-06 22:46:42,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 145 transitions, 302 flow [2023-11-06 22:46:42,487 INFO L124 PetriNetUnfolderBase]: 3/145 cut-off events. [2023-11-06 22:46:42,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:46:42,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 3/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 120 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-06 22:46:42,492 INFO L119 LiptonReduction]: Number of co-enabled transitions 3916 [2023-11-06 22:46:51,578 INFO L134 LiptonReduction]: Checked pairs total: 10570 [2023-11-06 22:46:51,579 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-11-06 22:46:51,594 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:46:51,601 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;@5c9a1681, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:46:51,601 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:46:51,603 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:46:51,604 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:46:51,604 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:46:51,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:51,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:46:51,605 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:46:51,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:51,611 INFO L85 PathProgramCache]: Analyzing trace with hash 651, now seen corresponding path program 1 times [2023-11-06 22:46:51,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:51,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879098549] [2023-11-06 22:46:51,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:51,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:51,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879098549] [2023-11-06 22:46:51,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879098549] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:51,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:51,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:46:51,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145192810] [2023-11-06 22:46:51,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:51,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:46:51,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:51,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:46:51,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:46:51,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 295 [2023-11-06 22:46:51,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 2 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 22:46:51,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:51,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 295 [2023-11-06 22:46:51,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:53,685 INFO L124 PetriNetUnfolderBase]: 5973/8185 cut-off events. [2023-11-06 22:46:53,686 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-06 22:46:53,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16503 conditions, 8185 events. 5973/8185 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 41985 event pairs, 5973 based on Foata normal form. 0/7019 useless extension candidates. Maximal degree in co-relation 16491. Up to 8103 conditions per place. [2023-11-06 22:46:53,768 INFO L140 encePairwiseOnDemand]: 287/295 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-11-06 22:46:53,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-11-06 22:46:53,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:46:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:46:53,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 300 transitions. [2023-11-06 22:46:53,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5084745762711864 [2023-11-06 22:46:53,786 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 300 transitions. [2023-11-06 22:46:53,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 300 transitions. [2023-11-06 22:46:53,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:53,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 300 transitions. [2023-11-06 22:46:53,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 150.0) internal successors, (300), 2 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:53,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:53,801 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:53,803 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 2 states and 300 transitions. [2023-11-06 22:46:53,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-11-06 22:46:53,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:46:53,814 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-11-06 22:46:53,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-11-06 22:46:53,820 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-11-06 22:46:53,820 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-11-06 22:46:53,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 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 22:46:53,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:53,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:46:53,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:46:53,822 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:46:53,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:53,823 INFO L85 PathProgramCache]: Analyzing trace with hash 616873340, now seen corresponding path program 1 times [2023-11-06 22:46:53,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:53,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058546673] [2023-11-06 22:46:53,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:53,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:54,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:54,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058546673] [2023-11-06 22:46:54,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058546673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:54,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:54,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:46:54,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795810889] [2023-11-06 22:46:54,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:54,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:54,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:54,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:54,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:54,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 295 [2023-11-06 22:46:54,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:54,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:54,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 295 [2023-11-06 22:46:54,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:55,640 INFO L124 PetriNetUnfolderBase]: 4695/6537 cut-off events. [2023-11-06 22:46:55,640 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:46:55,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13110 conditions, 6537 events. 4695/6537 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 32855 event pairs, 1757 based on Foata normal form. 0/6004 useless extension candidates. Maximal degree in co-relation 13107. Up to 5107 conditions per place. [2023-11-06 22:46:55,687 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 39 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-11-06 22:46:55,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 192 flow [2023-11-06 22:46:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-11-06 22:46:55,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4971751412429379 [2023-11-06 22:46:55,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-11-06 22:46:55,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-11-06 22:46:55,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:55,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-11-06 22:46:55,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:55,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:55,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:55,700 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 440 transitions. [2023-11-06 22:46:55,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 192 flow [2023-11-06 22:46:55,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:46:55,702 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-11-06 22:46:55,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-11-06 22:46:55,703 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-11-06 22:46:55,703 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-11-06 22:46:55,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:55,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:55,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:55,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:46:55,705 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:46:55,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:55,706 INFO L85 PathProgramCache]: Analyzing trace with hash 691653558, now seen corresponding path program 1 times [2023-11-06 22:46:55,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:55,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194123482] [2023-11-06 22:46:55,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:55,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:56,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:56,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:56,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194123482] [2023-11-06 22:46:56,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194123482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:56,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:56,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:56,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514468187] [2023-11-06 22:46:56,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:56,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:46:56,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:56,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:46:56,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:46:56,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 295 [2023-11-06 22:46:56,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:56,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:56,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 295 [2023-11-06 22:46:56,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:57,807 INFO L124 PetriNetUnfolderBase]: 3159/4437 cut-off events. [2023-11-06 22:46:57,807 INFO L125 PetriNetUnfolderBase]: For 292/292 co-relation queries the response was YES. [2023-11-06 22:46:57,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9260 conditions, 4437 events. 3159/4437 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 21957 event pairs, 576 based on Foata normal form. 0/4373 useless extension candidates. Maximal degree in co-relation 9256. Up to 4112 conditions per place. [2023-11-06 22:46:57,848 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 37 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-11-06 22:46:57,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 188 flow [2023-11-06 22:46:57,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:46:57,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:46:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2023-11-06 22:46:57,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4101694915254237 [2023-11-06 22:46:57,852 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 726 transitions. [2023-11-06 22:46:57,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 726 transitions. [2023-11-06 22:46:57,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:57,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 726 transitions. [2023-11-06 22:46:57,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:57,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:57,862 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:57,862 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 6 states and 726 transitions. [2023-11-06 22:46:57,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 188 flow [2023-11-06 22:46:57,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:46:57,865 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 70 flow [2023-11-06 22:46:57,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-11-06 22:46:57,867 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2023-11-06 22:46:57,867 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 70 flow [2023-11-06 22:46:57,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:57,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:57,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:57,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:46:57,873 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:46:57,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:57,874 INFO L85 PathProgramCache]: Analyzing trace with hash 691653544, now seen corresponding path program 1 times [2023-11-06 22:46:57,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:57,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966473693] [2023-11-06 22:46:57,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:57,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:58,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:58,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966473693] [2023-11-06 22:46:58,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966473693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:58,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:58,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:46:58,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473394485] [2023-11-06 22:46:58,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:58,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:46:58,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:58,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:46:58,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:58,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 295 [2023-11-06 22:46:58,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:58,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:58,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 295 [2023-11-06 22:46:58,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:59,531 INFO L124 PetriNetUnfolderBase]: 3991/5552 cut-off events. [2023-11-06 22:46:59,532 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-11-06 22:46:59,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11348 conditions, 5552 events. 3991/5552 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 26311 event pairs, 2113 based on Foata normal form. 8/5550 useless extension candidates. Maximal degree in co-relation 11344. Up to 5293 conditions per place. [2023-11-06 22:46:59,570 INFO L140 encePairwiseOnDemand]: 288/295 looper letters, 41 selfloop transitions, 11 changer transitions 0/55 dead transitions. [2023-11-06 22:46:59,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 246 flow [2023-11-06 22:46:59,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:46:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:46:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2023-11-06 22:46:59,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4822033898305085 [2023-11-06 22:46:59,575 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2023-11-06 22:46:59,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2023-11-06 22:46:59,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:59,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2023-11-06 22:46:59,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:59,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:59,583 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:59,584 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 70 flow. Second operand 4 states and 569 transitions. [2023-11-06 22:46:59,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 246 flow [2023-11-06 22:46:59,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 233 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:46:59,587 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 125 flow [2023-11-06 22:46:59,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2023-11-06 22:46:59,588 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2023-11-06 22:46:59,588 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 125 flow [2023-11-06 22:46:59,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:59,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:59,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:59,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:46:59,590 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:46:59,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:59,591 INFO L85 PathProgramCache]: Analyzing trace with hash -33589678, now seen corresponding path program 1 times [2023-11-06 22:46:59,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:59,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039739938] [2023-11-06 22:46:59,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:59,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:00,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:00,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039739938] [2023-11-06 22:47:00,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039739938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:00,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:00,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:47:00,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139109845] [2023-11-06 22:47:00,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:00,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:47:00,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:00,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:47:00,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:47:00,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 295 [2023-11-06 22:47:00,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 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 22:47:00,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:00,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 295 [2023-11-06 22:47:00,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:01,849 INFO L124 PetriNetUnfolderBase]: 8294/11179 cut-off events. [2023-11-06 22:47:01,849 INFO L125 PetriNetUnfolderBase]: For 1965/1965 co-relation queries the response was YES. [2023-11-06 22:47:01,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26439 conditions, 11179 events. 8294/11179 cut-off events. For 1965/1965 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 51319 event pairs, 2969 based on Foata normal form. 54/11233 useless extension candidates. Maximal degree in co-relation 26434. Up to 10404 conditions per place. [2023-11-06 22:47:01,916 INFO L140 encePairwiseOnDemand]: 283/295 looper letters, 71 selfloop transitions, 23 changer transitions 0/94 dead transitions. [2023-11-06 22:47:01,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 94 transitions, 472 flow [2023-11-06 22:47:01,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:47:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:47:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 823 transitions. [2023-11-06 22:47:01,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46497175141242936 [2023-11-06 22:47:01,921 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 823 transitions. [2023-11-06 22:47:01,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 823 transitions. [2023-11-06 22:47:01,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:01,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 823 transitions. [2023-11-06 22:47:01,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.16666666666666) internal successors, (823), 6 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:01,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:01,930 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:01,930 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 125 flow. Second operand 6 states and 823 transitions. [2023-11-06 22:47:01,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 94 transitions, 472 flow [2023-11-06 22:47:01,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 94 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:47:01,941 INFO L231 Difference]: Finished difference. Result has 50 places, 54 transitions, 272 flow [2023-11-06 22:47:01,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=50, PETRI_TRANSITIONS=54} [2023-11-06 22:47:01,942 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-11-06 22:47:01,942 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 54 transitions, 272 flow [2023-11-06 22:47:01,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 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 22:47:01,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:01,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:01,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:47:01,944 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:01,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:01,944 INFO L85 PathProgramCache]: Analyzing trace with hash -33578518, now seen corresponding path program 2 times [2023-11-06 22:47:01,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:01,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149168856] [2023-11-06 22:47:01,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:01,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:02,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:02,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149168856] [2023-11-06 22:47:02,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149168856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:02,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:02,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:47:02,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719577124] [2023-11-06 22:47:02,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:02,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:47:02,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:02,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:47:02,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:47:02,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2023-11-06 22:47:02,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 54 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:02,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:02,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2023-11-06 22:47:02,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:03,816 INFO L124 PetriNetUnfolderBase]: 7134/9910 cut-off events. [2023-11-06 22:47:03,816 INFO L125 PetriNetUnfolderBase]: For 10712/11217 co-relation queries the response was YES. [2023-11-06 22:47:03,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29742 conditions, 9910 events. 7134/9910 cut-off events. For 10712/11217 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 50407 event pairs, 2739 based on Foata normal form. 167/9726 useless extension candidates. Maximal degree in co-relation 29733. Up to 8145 conditions per place. [2023-11-06 22:47:03,908 INFO L140 encePairwiseOnDemand]: 287/295 looper letters, 55 selfloop transitions, 26 changer transitions 0/89 dead transitions. [2023-11-06 22:47:03,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 89 transitions, 560 flow [2023-11-06 22:47:03,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:47:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:47:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2023-11-06 22:47:03,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4940677966101695 [2023-11-06 22:47:03,912 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2023-11-06 22:47:03,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2023-11-06 22:47:03,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:03,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2023-11-06 22:47:03,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.75) internal successors, (583), 4 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 22:47:03,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:03,917 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:03,918 INFO L175 Difference]: Start difference. First operand has 50 places, 54 transitions, 272 flow. Second operand 4 states and 583 transitions. [2023-11-06 22:47:03,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 89 transitions, 560 flow [2023-11-06 22:47:03,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 89 transitions, 551 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:47:03,935 INFO L231 Difference]: Finished difference. Result has 54 places, 64 transitions, 416 flow [2023-11-06 22:47:03,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=416, PETRI_PLACES=54, PETRI_TRANSITIONS=64} [2023-11-06 22:47:03,936 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-11-06 22:47:03,936 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 64 transitions, 416 flow [2023-11-06 22:47:03,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:03,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:03,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:03,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:47:03,938 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:03,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:03,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1821749280, now seen corresponding path program 1 times [2023-11-06 22:47:03,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:03,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746477888] [2023-11-06 22:47:03,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:03,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:04,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746477888] [2023-11-06 22:47:04,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746477888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:04,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:04,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:04,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080767442] [2023-11-06 22:47:04,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:04,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:47:04,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:04,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:47:04,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:47:04,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 295 [2023-11-06 22:47:04,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 64 transitions, 416 flow. Second operand has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:04,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:04,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 295 [2023-11-06 22:47:04,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:06,265 INFO L124 PetriNetUnfolderBase]: 6972/9701 cut-off events. [2023-11-06 22:47:06,265 INFO L125 PetriNetUnfolderBase]: For 15903/16810 co-relation queries the response was YES. [2023-11-06 22:47:06,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33354 conditions, 9701 events. 6972/9701 cut-off events. For 15903/16810 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 49745 event pairs, 2305 based on Foata normal form. 191/9546 useless extension candidates. Maximal degree in co-relation 33342. Up to 7470 conditions per place. [2023-11-06 22:47:06,355 INFO L140 encePairwiseOnDemand]: 288/295 looper letters, 75 selfloop transitions, 19 changer transitions 0/102 dead transitions. [2023-11-06 22:47:06,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 102 transitions, 777 flow [2023-11-06 22:47:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:47:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:47:06,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2023-11-06 22:47:06,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864406779661017 [2023-11-06 22:47:06,358 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 574 transitions. [2023-11-06 22:47:06,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 574 transitions. [2023-11-06 22:47:06,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:06,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 574 transitions. [2023-11-06 22:47:06,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:06,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:06,365 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:06,365 INFO L175 Difference]: Start difference. First operand has 54 places, 64 transitions, 416 flow. Second operand 4 states and 574 transitions. [2023-11-06 22:47:06,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 102 transitions, 777 flow [2023-11-06 22:47:06,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 102 transitions, 754 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:47:06,390 INFO L231 Difference]: Finished difference. Result has 58 places, 72 transitions, 536 flow [2023-11-06 22:47:06,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=536, PETRI_PLACES=58, PETRI_TRANSITIONS=72} [2023-11-06 22:47:06,392 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-11-06 22:47:06,393 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 72 transitions, 536 flow [2023-11-06 22:47:06,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:06,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:06,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:06,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:47:06,397 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:06,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:06,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1821841164, now seen corresponding path program 1 times [2023-11-06 22:47:06,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:06,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854288320] [2023-11-06 22:47:06,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:06,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:07,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:07,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854288320] [2023-11-06 22:47:07,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854288320] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:07,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:07,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:07,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310278720] [2023-11-06 22:47:07,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:07,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:47:07,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:07,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:47:07,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:47:07,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 295 [2023-11-06 22:47:07,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 72 transitions, 536 flow. Second operand has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:07,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:07,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 295 [2023-11-06 22:47:07,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:08,625 INFO L124 PetriNetUnfolderBase]: 9083/12289 cut-off events. [2023-11-06 22:47:08,626 INFO L125 PetriNetUnfolderBase]: For 24021/24021 co-relation queries the response was YES. [2023-11-06 22:47:08,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45139 conditions, 12289 events. 9083/12289 cut-off events. For 24021/24021 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 57637 event pairs, 3095 based on Foata normal form. 100/12389 useless extension candidates. Maximal degree in co-relation 45125. Up to 10072 conditions per place. [2023-11-06 22:47:08,836 INFO L140 encePairwiseOnDemand]: 285/295 looper letters, 79 selfloop transitions, 34 changer transitions 0/113 dead transitions. [2023-11-06 22:47:08,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 113 transitions, 961 flow [2023-11-06 22:47:08,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:47:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:47:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-11-06 22:47:08,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45084745762711864 [2023-11-06 22:47:08,849 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-11-06 22:47:08,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-11-06 22:47:08,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:08,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-11-06 22:47:08,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:08,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:08,859 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:08,859 INFO L175 Difference]: Start difference. First operand has 58 places, 72 transitions, 536 flow. Second operand 5 states and 665 transitions. [2023-11-06 22:47:08,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 113 transitions, 961 flow [2023-11-06 22:47:08,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 113 transitions, 932 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:08,958 INFO L231 Difference]: Finished difference. Result has 62 places, 85 transitions, 738 flow [2023-11-06 22:47:08,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=738, PETRI_PLACES=62, PETRI_TRANSITIONS=85} [2023-11-06 22:47:08,961 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-11-06 22:47:08,962 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 85 transitions, 738 flow [2023-11-06 22:47:08,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:08,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:08,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:08,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:47:08,963 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:08,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:08,964 INFO L85 PathProgramCache]: Analyzing trace with hash 470939223, now seen corresponding path program 1 times [2023-11-06 22:47:08,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:08,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142296501] [2023-11-06 22:47:08,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:08,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:09,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:09,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142296501] [2023-11-06 22:47:09,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142296501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:09,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:09,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:47:09,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450823091] [2023-11-06 22:47:09,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:09,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:09,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:09,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:09,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:09,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 295 [2023-11-06 22:47:09,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 85 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:09,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:09,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 295 [2023-11-06 22:47:09,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:10,157 INFO L124 PetriNetUnfolderBase]: 4738/6810 cut-off events. [2023-11-06 22:47:10,158 INFO L125 PetriNetUnfolderBase]: For 27891/28999 co-relation queries the response was YES. [2023-11-06 22:47:10,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28740 conditions, 6810 events. 4738/6810 cut-off events. For 27891/28999 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 36093 event pairs, 1496 based on Foata normal form. 487/6908 useless extension candidates. Maximal degree in co-relation 28725. Up to 5181 conditions per place. [2023-11-06 22:47:10,206 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 83 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2023-11-06 22:47:10,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 106 transitions, 1032 flow [2023-11-06 22:47:10,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-11-06 22:47:10,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48135593220338985 [2023-11-06 22:47:10,209 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-11-06 22:47:10,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-11-06 22:47:10,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:10,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-11-06 22:47:10,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:10,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:10,216 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:10,216 INFO L175 Difference]: Start difference. First operand has 62 places, 85 transitions, 738 flow. Second operand 3 states and 426 transitions. [2023-11-06 22:47:10,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 106 transitions, 1032 flow [2023-11-06 22:47:10,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 106 transitions, 987 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-11-06 22:47:10,268 INFO L231 Difference]: Finished difference. Result has 62 places, 79 transitions, 633 flow [2023-11-06 22:47:10,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=62, PETRI_TRANSITIONS=79} [2023-11-06 22:47:10,270 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-11-06 22:47:10,270 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 79 transitions, 633 flow [2023-11-06 22:47:10,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:10,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:10,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:10,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:47:10,271 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:10,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:10,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1221738491, now seen corresponding path program 1 times [2023-11-06 22:47:10,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:10,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641193505] [2023-11-06 22:47:10,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:10,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:10,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:10,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641193505] [2023-11-06 22:47:10,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641193505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:10,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:10,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:47:10,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907353416] [2023-11-06 22:47:10,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:10,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:47:10,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:10,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:47:10,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:47:10,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 295 [2023-11-06 22:47:10,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 79 transitions, 633 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:10,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:10,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 295 [2023-11-06 22:47:10,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:11,243 INFO L124 PetriNetUnfolderBase]: 2538/3817 cut-off events. [2023-11-06 22:47:11,243 INFO L125 PetriNetUnfolderBase]: For 13862/14563 co-relation queries the response was YES. [2023-11-06 22:47:11,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16890 conditions, 3817 events. 2538/3817 cut-off events. For 13862/14563 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 19564 event pairs, 483 based on Foata normal form. 467/4085 useless extension candidates. Maximal degree in co-relation 16875. Up to 1638 conditions per place. [2023-11-06 22:47:11,281 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 97 selfloop transitions, 9 changer transitions 0/124 dead transitions. [2023-11-06 22:47:11,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 124 transitions, 1158 flow [2023-11-06 22:47:11,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:47:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:47:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2023-11-06 22:47:11,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4830508474576271 [2023-11-06 22:47:11,285 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2023-11-06 22:47:11,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2023-11-06 22:47:11,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:11,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2023-11-06 22:47:11,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:11,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:11,291 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:11,292 INFO L175 Difference]: Start difference. First operand has 62 places, 79 transitions, 633 flow. Second operand 4 states and 570 transitions. [2023-11-06 22:47:11,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 124 transitions, 1158 flow [2023-11-06 22:47:11,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 124 transitions, 1153 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:47:11,322 INFO L231 Difference]: Finished difference. Result has 65 places, 79 transitions, 648 flow [2023-11-06 22:47:11,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=648, PETRI_PLACES=65, PETRI_TRANSITIONS=79} [2023-11-06 22:47:11,325 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2023-11-06 22:47:11,325 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 79 transitions, 648 flow [2023-11-06 22:47:11,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:11,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:11,327 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 22:47:11,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:47:11,328 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:11,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:11,329 INFO L85 PathProgramCache]: Analyzing trace with hash 578138876, now seen corresponding path program 1 times [2023-11-06 22:47:11,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:11,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064363984] [2023-11-06 22:47:11,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:11,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:11,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:11,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064363984] [2023-11-06 22:47:11,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064363984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:11,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:11,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:11,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821511585] [2023-11-06 22:47:11,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:11,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:47:11,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:11,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:47:11,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:47:11,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 295 [2023-11-06 22:47:11,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 79 transitions, 648 flow. Second operand has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:11,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:11,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 295 [2023-11-06 22:47:11,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:12,211 INFO L124 PetriNetUnfolderBase]: 1972/2938 cut-off events. [2023-11-06 22:47:12,211 INFO L125 PetriNetUnfolderBase]: For 12810/13433 co-relation queries the response was YES. [2023-11-06 22:47:12,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13754 conditions, 2938 events. 1972/2938 cut-off events. For 12810/13433 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 14866 event pairs, 340 based on Foata normal form. 298/3066 useless extension candidates. Maximal degree in co-relation 13738. Up to 1322 conditions per place. [2023-11-06 22:47:12,239 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 108 selfloop transitions, 13 changer transitions 0/139 dead transitions. [2023-11-06 22:47:12,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 139 transitions, 1311 flow [2023-11-06 22:47:12,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:47:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:47:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2023-11-06 22:47:12,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48271186440677966 [2023-11-06 22:47:12,244 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2023-11-06 22:47:12,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2023-11-06 22:47:12,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:12,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2023-11-06 22:47:12,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:12,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:12,253 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:12,253 INFO L175 Difference]: Start difference. First operand has 65 places, 79 transitions, 648 flow. Second operand 5 states and 712 transitions. [2023-11-06 22:47:12,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 139 transitions, 1311 flow [2023-11-06 22:47:12,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 139 transitions, 1275 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:12,274 INFO L231 Difference]: Finished difference. Result has 68 places, 83 transitions, 690 flow [2023-11-06 22:47:12,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=690, PETRI_PLACES=68, PETRI_TRANSITIONS=83} [2023-11-06 22:47:12,275 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2023-11-06 22:47:12,276 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 83 transitions, 690 flow [2023-11-06 22:47:12,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:12,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:12,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:12,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:47:12,277 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:12,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:12,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1386327215, now seen corresponding path program 1 times [2023-11-06 22:47:12,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:12,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160200917] [2023-11-06 22:47:12,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:12,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:12,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:12,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:12,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160200917] [2023-11-06 22:47:12,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160200917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:12,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:12,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:47:12,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534109512] [2023-11-06 22:47:12,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:12,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:47:12,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:12,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:47:12,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:47:12,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 295 [2023-11-06 22:47:12,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 83 transitions, 690 flow. Second operand has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:12,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:12,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 295 [2023-11-06 22:47:12,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:13,434 INFO L124 PetriNetUnfolderBase]: 2864/4387 cut-off events. [2023-11-06 22:47:13,435 INFO L125 PetriNetUnfolderBase]: For 17293/17918 co-relation queries the response was YES. [2023-11-06 22:47:13,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20328 conditions, 4387 events. 2864/4387 cut-off events. For 17293/17918 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 23986 event pairs, 298 based on Foata normal form. 261/4558 useless extension candidates. Maximal degree in co-relation 20311. Up to 1942 conditions per place. [2023-11-06 22:47:13,464 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 109 selfloop transitions, 2 changer transitions 41/167 dead transitions. [2023-11-06 22:47:13,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 167 transitions, 1701 flow [2023-11-06 22:47:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:47:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:47:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2023-11-06 22:47:13,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4830508474576271 [2023-11-06 22:47:13,468 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2023-11-06 22:47:13,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2023-11-06 22:47:13,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:13,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2023-11-06 22:47:13,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:13,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:13,476 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:13,476 INFO L175 Difference]: Start difference. First operand has 68 places, 83 transitions, 690 flow. Second operand 4 states and 570 transitions. [2023-11-06 22:47:13,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 167 transitions, 1701 flow [2023-11-06 22:47:13,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 167 transitions, 1601 flow, removed 27 selfloop flow, removed 3 redundant places. [2023-11-06 22:47:13,541 INFO L231 Difference]: Finished difference. Result has 70 places, 84 transitions, 673 flow [2023-11-06 22:47:13,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=673, PETRI_PLACES=70, PETRI_TRANSITIONS=84} [2023-11-06 22:47:13,542 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2023-11-06 22:47:13,542 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 84 transitions, 673 flow [2023-11-06 22:47:13,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:13,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:13,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:13,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:47:13,543 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:13,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:13,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1645183181, now seen corresponding path program 2 times [2023-11-06 22:47:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:13,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314909411] [2023-11-06 22:47:13,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:13,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:13,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:13,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314909411] [2023-11-06 22:47:13,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314909411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:13,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:13,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:47:13,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175622981] [2023-11-06 22:47:13,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:13,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:47:13,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:13,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:47:13,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:47:13,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 295 [2023-11-06 22:47:13,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 84 transitions, 673 flow. Second operand has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:13,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:13,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 295 [2023-11-06 22:47:13,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:14,779 INFO L124 PetriNetUnfolderBase]: 2645/3900 cut-off events. [2023-11-06 22:47:14,779 INFO L125 PetriNetUnfolderBase]: For 16425/17044 co-relation queries the response was YES. [2023-11-06 22:47:14,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18003 conditions, 3900 events. 2645/3900 cut-off events. For 16425/17044 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 21157 event pairs, 416 based on Foata normal form. 264/3925 useless extension candidates. Maximal degree in co-relation 17984. Up to 1789 conditions per place. [2023-11-06 22:47:14,796 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 89 selfloop transitions, 17 changer transitions 19/140 dead transitions. [2023-11-06 22:47:14,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 140 transitions, 1311 flow [2023-11-06 22:47:14,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:47:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:47:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 840 transitions. [2023-11-06 22:47:14,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4745762711864407 [2023-11-06 22:47:14,801 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 840 transitions. [2023-11-06 22:47:14,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 840 transitions. [2023-11-06 22:47:14,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:14,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 840 transitions. [2023-11-06 22:47:14,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:14,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:14,810 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:14,810 INFO L175 Difference]: Start difference. First operand has 70 places, 84 transitions, 673 flow. Second operand 6 states and 840 transitions. [2023-11-06 22:47:14,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 140 transitions, 1311 flow [2023-11-06 22:47:14,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 140 transitions, 1277 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-11-06 22:47:14,879 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 607 flow [2023-11-06 22:47:14,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=607, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2023-11-06 22:47:14,880 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places. [2023-11-06 22:47:14,880 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 607 flow [2023-11-06 22:47:14,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:14,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:14,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:14,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:47:14,881 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:14,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:14,882 INFO L85 PathProgramCache]: Analyzing trace with hash 373335950, now seen corresponding path program 1 times [2023-11-06 22:47:14,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:14,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387203680] [2023-11-06 22:47:14,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:14,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:15,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:15,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387203680] [2023-11-06 22:47:15,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387203680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:15,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:15,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:15,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289190103] [2023-11-06 22:47:15,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:15,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:47:15,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:15,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:47:15,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:47:15,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 295 [2023-11-06 22:47:15,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 607 flow. Second operand has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:15,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:15,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 295 [2023-11-06 22:47:15,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:16,141 INFO L124 PetriNetUnfolderBase]: 2397/3612 cut-off events. [2023-11-06 22:47:16,142 INFO L125 PetriNetUnfolderBase]: For 13184/13408 co-relation queries the response was YES. [2023-11-06 22:47:16,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17164 conditions, 3612 events. 2397/3612 cut-off events. For 13184/13408 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17884 event pairs, 167 based on Foata normal form. 179/3778 useless extension candidates. Maximal degree in co-relation 17144. Up to 1445 conditions per place. [2023-11-06 22:47:16,167 INFO L140 encePairwiseOnDemand]: 288/295 looper letters, 87 selfloop transitions, 5 changer transitions 77/173 dead transitions. [2023-11-06 22:47:16,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 173 transitions, 1708 flow [2023-11-06 22:47:16,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:47:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:47:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 795 transitions. [2023-11-06 22:47:16,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4491525423728814 [2023-11-06 22:47:16,171 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 795 transitions. [2023-11-06 22:47:16,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 795 transitions. [2023-11-06 22:47:16,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:16,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 795 transitions. [2023-11-06 22:47:16,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:16,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:16,180 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:16,180 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 607 flow. Second operand 6 states and 795 transitions. [2023-11-06 22:47:16,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 173 transitions, 1708 flow [2023-11-06 22:47:16,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 173 transitions, 1587 flow, removed 28 selfloop flow, removed 5 redundant places. [2023-11-06 22:47:16,228 INFO L231 Difference]: Finished difference. Result has 78 places, 65 transitions, 489 flow [2023-11-06 22:47:16,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=489, PETRI_PLACES=78, PETRI_TRANSITIONS=65} [2023-11-06 22:47:16,230 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2023-11-06 22:47:16,230 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 489 flow [2023-11-06 22:47:16,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:16,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:16,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:16,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:47:16,232 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:16,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:16,232 INFO L85 PathProgramCache]: Analyzing trace with hash -421591306, now seen corresponding path program 2 times [2023-11-06 22:47:16,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:16,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955742244] [2023-11-06 22:47:16,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:16,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:16,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:16,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955742244] [2023-11-06 22:47:16,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955742244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:16,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:16,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:16,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611654294] [2023-11-06 22:47:16,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:16,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:47:16,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:16,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:47:16,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:47:16,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 295 [2023-11-06 22:47:16,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 489 flow. Second operand has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:16,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:16,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 295 [2023-11-06 22:47:16,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:17,502 INFO L124 PetriNetUnfolderBase]: 1976/3067 cut-off events. [2023-11-06 22:47:17,502 INFO L125 PetriNetUnfolderBase]: For 9658/9756 co-relation queries the response was YES. [2023-11-06 22:47:17,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13995 conditions, 3067 events. 1976/3067 cut-off events. For 9658/9756 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15197 event pairs, 351 based on Foata normal form. 72/3131 useless extension candidates. Maximal degree in co-relation 13972. Up to 1848 conditions per place. [2023-11-06 22:47:17,514 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 65 selfloop transitions, 3 changer transitions 74/144 dead transitions. [2023-11-06 22:47:17,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 144 transitions, 1263 flow [2023-11-06 22:47:17,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:47:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:47:17,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 799 transitions. [2023-11-06 22:47:17,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4514124293785311 [2023-11-06 22:47:17,519 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 799 transitions. [2023-11-06 22:47:17,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 799 transitions. [2023-11-06 22:47:17,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:17,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 799 transitions. [2023-11-06 22:47:17,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:17,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:17,527 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:17,528 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 489 flow. Second operand 6 states and 799 transitions. [2023-11-06 22:47:17,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 144 transitions, 1263 flow [2023-11-06 22:47:17,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 144 transitions, 1248 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-06 22:47:17,562 INFO L231 Difference]: Finished difference. Result has 77 places, 51 transitions, 348 flow [2023-11-06 22:47:17,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=77, PETRI_TRANSITIONS=51} [2023-11-06 22:47:17,563 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2023-11-06 22:47:17,563 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 51 transitions, 348 flow [2023-11-06 22:47:17,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:17,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:17,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:17,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:47:17,564 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:17,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:17,565 INFO L85 PathProgramCache]: Analyzing trace with hash -260271578, now seen corresponding path program 3 times [2023-11-06 22:47:17,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:17,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178222815] [2023-11-06 22:47:17,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:17,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:19,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:19,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178222815] [2023-11-06 22:47:19,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178222815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:19,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:19,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:47:19,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054971215] [2023-11-06 22:47:19,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:19,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:47:19,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:19,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:47:19,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:47:19,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 295 [2023-11-06 22:47:19,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 51 transitions, 348 flow. Second operand has 10 states, 10 states have (on average 127.4) internal successors, (1274), 10 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:19,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:19,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 295 [2023-11-06 22:47:19,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:19,889 INFO L124 PetriNetUnfolderBase]: 1390/2199 cut-off events. [2023-11-06 22:47:19,889 INFO L125 PetriNetUnfolderBase]: For 6228/6260 co-relation queries the response was YES. [2023-11-06 22:47:19,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9672 conditions, 2199 events. 1390/2199 cut-off events. For 6228/6260 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10844 event pairs, 193 based on Foata normal form. 15/2166 useless extension candidates. Maximal degree in co-relation 9649. Up to 1090 conditions per place. [2023-11-06 22:47:19,898 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 78 selfloop transitions, 9 changer transitions 16/106 dead transitions. [2023-11-06 22:47:19,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 106 transitions, 868 flow [2023-11-06 22:47:19,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:47:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:47:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 809 transitions. [2023-11-06 22:47:19,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45706214689265534 [2023-11-06 22:47:19,903 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 809 transitions. [2023-11-06 22:47:19,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 809 transitions. [2023-11-06 22:47:19,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:19,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 809 transitions. [2023-11-06 22:47:19,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.83333333333334) internal successors, (809), 6 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:19,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:19,913 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:19,913 INFO L175 Difference]: Start difference. First operand has 77 places, 51 transitions, 348 flow. Second operand 6 states and 809 transitions. [2023-11-06 22:47:19,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 106 transitions, 868 flow [2023-11-06 22:47:19,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 106 transitions, 840 flow, removed 4 selfloop flow, removed 9 redundant places. [2023-11-06 22:47:19,941 INFO L231 Difference]: Finished difference. Result has 72 places, 54 transitions, 386 flow [2023-11-06 22:47:19,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=72, PETRI_TRANSITIONS=54} [2023-11-06 22:47:19,942 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2023-11-06 22:47:19,942 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 386 flow [2023-11-06 22:47:19,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 127.4) internal successors, (1274), 10 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:19,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:19,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:19,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:47:19,953 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:19,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1309774006, now seen corresponding path program 4 times [2023-11-06 22:47:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:19,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102827216] [2023-11-06 22:47:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:19,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:21,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:21,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102827216] [2023-11-06 22:47:21,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102827216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:21,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:21,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:47:21,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739656511] [2023-11-06 22:47:21,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:21,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:47:21,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:21,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:47:21,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:47:21,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 295 [2023-11-06 22:47:21,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 54 transitions, 386 flow. Second operand has 8 states, 8 states have (on average 130.0) internal successors, (1040), 8 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:21,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:21,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 295 [2023-11-06 22:47:21,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:21,648 INFO L124 PetriNetUnfolderBase]: 1590/2551 cut-off events. [2023-11-06 22:47:21,648 INFO L125 PetriNetUnfolderBase]: For 8785/8817 co-relation queries the response was YES. [2023-11-06 22:47:21,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11547 conditions, 2551 events. 1590/2551 cut-off events. For 8785/8817 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13063 event pairs, 257 based on Foata normal form. 16/2518 useless extension candidates. Maximal degree in co-relation 11525. Up to 1506 conditions per place. [2023-11-06 22:47:21,658 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 68 selfloop transitions, 12 changer transitions 7/90 dead transitions. [2023-11-06 22:47:21,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 90 transitions, 770 flow [2023-11-06 22:47:21,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:47:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:47:21,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 683 transitions. [2023-11-06 22:47:21,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46305084745762715 [2023-11-06 22:47:21,661 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 683 transitions. [2023-11-06 22:47:21,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 683 transitions. [2023-11-06 22:47:21,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:21,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 683 transitions. [2023-11-06 22:47:21,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:21,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:21,668 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:21,668 INFO L175 Difference]: Start difference. First operand has 72 places, 54 transitions, 386 flow. Second operand 5 states and 683 transitions. [2023-11-06 22:47:21,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 90 transitions, 770 flow [2023-11-06 22:47:21,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 90 transitions, 759 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-06 22:47:21,706 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 460 flow [2023-11-06 22:47:21,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=460, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2023-11-06 22:47:21,707 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places. [2023-11-06 22:47:21,707 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 460 flow [2023-11-06 22:47:21,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 130.0) internal successors, (1040), 8 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:21,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:21,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:21,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:47:21,708 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:21,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:21,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1547372550, now seen corresponding path program 5 times [2023-11-06 22:47:21,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:21,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035662757] [2023-11-06 22:47:21,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:21,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:23,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:23,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035662757] [2023-11-06 22:47:23,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035662757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:23,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:23,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:47:23,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780669144] [2023-11-06 22:47:23,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:23,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:47:23,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:23,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:47:23,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:47:23,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 295 [2023-11-06 22:47:23,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 460 flow. Second operand has 10 states, 10 states have (on average 130.4) internal successors, (1304), 10 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:23,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:23,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 295 [2023-11-06 22:47:23,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:24,355 INFO L124 PetriNetUnfolderBase]: 1862/3040 cut-off events. [2023-11-06 22:47:24,355 INFO L125 PetriNetUnfolderBase]: For 12293/12334 co-relation queries the response was YES. [2023-11-06 22:47:24,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14436 conditions, 3040 events. 1862/3040 cut-off events. For 12293/12334 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 16415 event pairs, 277 based on Foata normal form. 21/3013 useless extension candidates. Maximal degree in co-relation 14412. Up to 1016 conditions per place. [2023-11-06 22:47:24,371 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 78 selfloop transitions, 10 changer transitions 42/133 dead transitions. [2023-11-06 22:47:24,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 133 transitions, 1203 flow [2023-11-06 22:47:24,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:47:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:47:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 839 transitions. [2023-11-06 22:47:24,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47401129943502823 [2023-11-06 22:47:24,376 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 839 transitions. [2023-11-06 22:47:24,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 839 transitions. [2023-11-06 22:47:24,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:24,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 839 transitions. [2023-11-06 22:47:24,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.83333333333334) internal successors, (839), 6 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:24,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:24,383 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:24,383 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 460 flow. Second operand 6 states and 839 transitions. [2023-11-06 22:47:24,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 133 transitions, 1203 flow [2023-11-06 22:47:24,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 133 transitions, 1196 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:24,453 INFO L231 Difference]: Finished difference. Result has 80 places, 57 transitions, 493 flow [2023-11-06 22:47:24,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=493, PETRI_PLACES=80, PETRI_TRANSITIONS=57} [2023-11-06 22:47:24,454 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2023-11-06 22:47:24,454 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 57 transitions, 493 flow [2023-11-06 22:47:24,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 130.4) internal successors, (1304), 10 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:24,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:24,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:24,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:47:24,456 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:24,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:24,456 INFO L85 PathProgramCache]: Analyzing trace with hash 755646220, now seen corresponding path program 6 times [2023-11-06 22:47:24,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:24,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575270645] [2023-11-06 22:47:24,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:24,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:47:24,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:47:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:47:24,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:47:24,621 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:47:24,622 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:47:24,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:47:24,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:47:24,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:47:24,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:47:24,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:47:24,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:47:24,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:47:24,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:47:24,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:47:24,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:47:24,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:47:24,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:47:24,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:47:24,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:47:24,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:47:24,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:47:24,631 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:24,638 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:47:24,638 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:47:24,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:47:24 BasicIcfg [2023-11-06 22:47:24,775 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:47:24,776 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:47:24,776 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:47:24,776 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:47:24,777 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:42" (3/4) ... [2023-11-06 22:47:24,779 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:47:24,780 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:47:24,780 INFO L158 Benchmark]: Toolchain (without parser) took 44420.44ms. Allocated memory was 140.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 103.1MB in the beginning and 1.1GB in the end (delta: -975.3MB). Peak memory consumption was 821.9MB. Max. memory is 16.1GB. [2023-11-06 22:47:24,781 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 104.9MB. Free memory is still 54.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:47:24,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 675.43ms. Allocated memory is still 140.5MB. Free memory was 102.7MB in the beginning and 78.8MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:47:24,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.67ms. Allocated memory is still 140.5MB. Free memory was 78.4MB in the beginning and 76.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:47:24,782 INFO L158 Benchmark]: Boogie Preprocessor took 52.19ms. Allocated memory is still 140.5MB. Free memory was 76.0MB in the beginning and 73.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:47:24,782 INFO L158 Benchmark]: RCFGBuilder took 932.26ms. Allocated memory is still 140.5MB. Free memory was 73.9MB in the beginning and 71.9MB in the end (delta: 2.0MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2023-11-06 22:47:24,783 INFO L158 Benchmark]: TraceAbstraction took 42688.76ms. Allocated memory was 140.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 71.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 787.3MB. Max. memory is 16.1GB. [2023-11-06 22:47:24,783 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 1.9GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:47:24,785 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 104.9MB. Free memory is still 54.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 675.43ms. Allocated memory is still 140.5MB. Free memory was 102.7MB in the beginning and 78.8MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.67ms. Allocated memory is still 140.5MB. Free memory was 78.4MB in the beginning and 76.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.19ms. Allocated memory is still 140.5MB. Free memory was 76.0MB in the beginning and 73.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 932.26ms. Allocated memory is still 140.5MB. Free memory was 73.9MB in the beginning and 71.9MB in the end (delta: 2.0MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * TraceAbstraction took 42688.76ms. Allocated memory was 140.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 71.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 787.3MB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 1.9GB. Free memory is still 1.1GB. 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.2s, 155 PlacesBefore, 51 PlacesAfterwards, 145 TransitionsBefore, 38 TransitionsAfterwards, 3916 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 146 TotalNumberOfCompositions, 10570 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4496, independent: 4256, independent conditional: 0, independent unconditional: 4256, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2083, independent: 2034, independent conditional: 0, independent unconditional: 2034, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4496, independent: 2222, independent conditional: 0, independent unconditional: 2222, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 2083, unknown conditional: 0, unknown unconditional: 2083] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 125, Positive conditional cache size: 0, Positive unconditional cache size: 125, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1377, ((void *)0), P0, ((void *)0))=-2, t1377={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1378, ((void *)0), P1, ((void *)0))=-1, t1377={5:0}, t1378={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1379, ((void *)0), P2, ((void *)0))=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1380, ((void *)0), P3, ((void *)0))=1, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 [L883] 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", "mix051_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 849]: 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: 851]: 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: 853]: 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 9 procedures, 184 locations, 16 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: 42.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1043 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 831 mSDsluCounter, 507 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 392 mSDsCounter, 303 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2587 IncrementalHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 303 mSolverCounterUnsat, 115 mSDtfsCounter, 2587 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=738occurred in iteration=8, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 3431 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:47:24,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/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_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/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_9bb12cd3-db6c-46a0-b58d-5880a085c94b/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 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:47:27,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:47:27,675 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:47:27,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:47:27,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:47:27,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:47:27,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:47:27,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:47:27,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:47:27,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:47:27,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:47:27,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:47:27,742 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:47:27,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:47:27,743 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:47:27,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:47:27,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:47:27,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:47:27,744 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:47:27,745 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:47:27,746 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:47:27,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:47:27,747 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:47:27,747 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:47:27,748 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:47:27,748 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:47:27,749 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:47:27,749 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:47:27,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:47:27,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:47:27,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:47:27,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:27,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:47:27,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:47:27,753 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:47:27,753 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:47:27,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:47:27,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:47:27,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:47:27,755 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:47:27,755 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:47:27,756 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_9bb12cd3-db6c-46a0-b58d-5880a085c94b/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_9bb12cd3-db6c-46a0-b58d-5880a085c94b/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 -> 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 [2023-11-06 22:47:28,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:47:28,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:47:28,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:47:28,196 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:47:28,196 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:47:28,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2023-11-06 22:47:31,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:47:31,580 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:47:31,581 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2023-11-06 22:47:31,604 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/data/c9180a389/8334cb1b79b14460bd48c91757a1048b/FLAGe290ed9b8 [2023-11-06 22:47:31,622 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/data/c9180a389/8334cb1b79b14460bd48c91757a1048b [2023-11-06 22:47:31,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:47:31,630 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:47:31,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:47:31,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:47:31,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:47:31,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:31" (1/1) ... [2023-11-06 22:47:31,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66dea3b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:31, skipping insertion in model container [2023-11-06 22:47:31,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:31" (1/1) ... [2023-11-06 22:47:31,730 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:47:32,270 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:47:32,291 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:47:32,374 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:47:32,436 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:47:32,436 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:47:32,444 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:47:32,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:32 WrapperNode [2023-11-06 22:47:32,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:47:32,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:47:32,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:47:32,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:47:32,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:32" (1/1) ... [2023-11-06 22:47:32,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:32" (1/1) ... [2023-11-06 22:47:32,518 INFO L138 Inliner]: procedures = 180, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 167 [2023-11-06 22:47:32,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:47:32,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:47:32,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:47:32,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:47:32,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:32" (1/1) ... [2023-11-06 22:47:32,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:32" (1/1) ... [2023-11-06 22:47:32,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:32" (1/1) ... [2023-11-06 22:47:32,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:32" (1/1) ... [2023-11-06 22:47:32,546 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:32" (1/1) ... [2023-11-06 22:47:32,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:32" (1/1) ... [2023-11-06 22:47:32,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:32" (1/1) ... [2023-11-06 22:47:32,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:32" (1/1) ... [2023-11-06 22:47:32,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:47:32,573 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:47:32,573 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:47:32,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:47:32,575 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:32" (1/1) ... [2023-11-06 22:47:32,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:32,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:47:32,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:47:32,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:47:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:47:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:47:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:47:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:47:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:47:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:47:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:47:32,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:47:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:47:32,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:47:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:47:32,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:47:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:47:32,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:47:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:47:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:47:32,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:47:32,682 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:47:32,844 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:47:32,846 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:47:33,390 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:47:33,590 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:47:33,590 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:47:33,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:33 BoogieIcfgContainer [2023-11-06 22:47:33,594 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:47:33,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:47:33,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:47:33,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:47:33,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:47:31" (1/3) ... [2023-11-06 22:47:33,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4899b7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:33, skipping insertion in model container [2023-11-06 22:47:33,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:32" (2/3) ... [2023-11-06 22:47:33,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4899b7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:33, skipping insertion in model container [2023-11-06 22:47:33,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:33" (3/3) ... [2023-11-06 22:47:33,609 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2023-11-06 22:47:33,629 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:47:33,629 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:47:33,629 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:47:33,741 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:47:33,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 22:47:33,887 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 22:47:33,887 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:47:33,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 120 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-06 22:47:33,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 22:47:33,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 146 transitions, 304 flow [2023-11-06 22:47:33,906 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:47:33,921 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-06 22:47:33,925 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-06 22:47:33,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 304 flow [2023-11-06 22:47:33,998 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 22:47:33,999 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:47:34,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 120 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-06 22:47:34,006 INFO L119 LiptonReduction]: Number of co-enabled transitions 3916 [2023-11-06 22:47:44,977 INFO L134 LiptonReduction]: Checked pairs total: 9819 [2023-11-06 22:47:44,977 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-11-06 22:47:45,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:47:45,026 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;@6dbace72, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:47:45,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:47:45,028 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:47:45,028 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:47:45,028 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:47:45,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:45,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:47:45,030 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:45,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:45,035 INFO L85 PathProgramCache]: Analyzing trace with hash 656, now seen corresponding path program 1 times [2023-11-06 22:47:45,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:45,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126277476] [2023-11-06 22:47:45,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:45,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:45,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:45,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:45,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:47:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:45,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:47:45,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:45,156 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:45,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:45,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126277476] [2023-11-06 22:47:45,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126277476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:45,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:45,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:47:45,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233018763] [2023-11-06 22:47:45,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:45,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:47:45,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:45,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:47:45,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:47:45,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 296 [2023-11-06 22:47:45,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:45,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:45,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 296 [2023-11-06 22:47:45,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:47,419 INFO L124 PetriNetUnfolderBase]: 7925/10777 cut-off events. [2023-11-06 22:47:47,420 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-06 22:47:47,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21687 conditions, 10777 events. 7925/10777 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 56365 event pairs, 7925 based on Foata normal form. 320/9423 useless extension candidates. Maximal degree in co-relation 21675. Up to 10695 conditions per place. [2023-11-06 22:47:47,524 INFO L140 encePairwiseOnDemand]: 287/296 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-11-06 22:47:47,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2023-11-06 22:47:47,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:47:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:47:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 305 transitions. [2023-11-06 22:47:47,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152027027027027 [2023-11-06 22:47:47,548 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 305 transitions. [2023-11-06 22:47:47,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 305 transitions. [2023-11-06 22:47:47,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:47,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 305 transitions. [2023-11-06 22:47:47,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:47,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:47,569 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:47,571 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 305 transitions. [2023-11-06 22:47:47,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2023-11-06 22:47:47,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:47:47,583 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-11-06 22:47:47,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-11-06 22:47:47,589 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-11-06 22:47:47,590 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-11-06 22:47:47,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:47,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:47,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:47:47,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:47,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:47,802 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:47,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:47,804 INFO L85 PathProgramCache]: Analyzing trace with hash 619715081, now seen corresponding path program 1 times [2023-11-06 22:47:47,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:47,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765734796] [2023-11-06 22:47:47,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:47,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:47,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:47,809 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:47,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:47:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:47,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:47:47,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:47,966 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:47,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:47,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765734796] [2023-11-06 22:47:47,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765734796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:47,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:47,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:47:47,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960469537] [2023-11-06 22:47:47,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:47,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:47,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:47,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:47,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:47,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 296 [2023-11-06 22:47:47,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:47,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:47,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 296 [2023-11-06 22:47:47,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:49,525 INFO L124 PetriNetUnfolderBase]: 6231/9017 cut-off events. [2023-11-06 22:47:49,525 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:47:49,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17638 conditions, 9017 events. 6231/9017 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 54530 event pairs, 1149 based on Foata normal form. 0/8216 useless extension candidates. Maximal degree in co-relation 17635. Up to 6739 conditions per place. [2023-11-06 22:47:49,606 INFO L140 encePairwiseOnDemand]: 293/296 looper letters, 41 selfloop transitions, 2 changer transitions 4/51 dead transitions. [2023-11-06 22:47:49,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 208 flow [2023-11-06 22:47:49,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2023-11-06 22:47:49,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033783783783784 [2023-11-06 22:47:49,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2023-11-06 22:47:49,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2023-11-06 22:47:49,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:49,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2023-11-06 22:47:49,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:49,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:49,627 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:49,627 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 447 transitions. [2023-11-06 22:47:49,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 208 flow [2023-11-06 22:47:49,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:47:49,630 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 70 flow [2023-11-06 22:47:49,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-11-06 22:47:49,631 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-11-06 22:47:49,631 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 70 flow [2023-11-06 22:47:49,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:49,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:49,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:49,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:49,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:49,841 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:49,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:49,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1478274742, now seen corresponding path program 1 times [2023-11-06 22:47:49,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:49,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461986116] [2023-11-06 22:47:49,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:49,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:49,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:49,877 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:49,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:47:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:50,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:47:50,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:50,092 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:50,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:50,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461986116] [2023-11-06 22:47:50,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461986116] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:50,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:50,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:47:50,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918645627] [2023-11-06 22:47:50,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:50,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:50,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:50,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:50,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:50,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 296 [2023-11-06 22:47:50,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:50,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:50,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 296 [2023-11-06 22:47:50,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:50,894 INFO L124 PetriNetUnfolderBase]: 3075/4418 cut-off events. [2023-11-06 22:47:50,894 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2023-11-06 22:47:50,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9257 conditions, 4418 events. 3075/4418 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 22504 event pairs, 693 based on Foata normal form. 81/4303 useless extension candidates. Maximal degree in co-relation 9253. Up to 3944 conditions per place. [2023-11-06 22:47:50,926 INFO L140 encePairwiseOnDemand]: 290/296 looper letters, 38 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2023-11-06 22:47:50,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 200 flow [2023-11-06 22:47:50,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:50,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-11-06 22:47:50,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48536036036036034 [2023-11-06 22:47:50,930 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-11-06 22:47:50,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-11-06 22:47:50,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:50,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-11-06 22:47:50,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:50,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:50,935 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:50,936 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 70 flow. Second operand 3 states and 431 transitions. [2023-11-06 22:47:50,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 200 flow [2023-11-06 22:47:50,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:50,938 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 99 flow [2023-11-06 22:47:50,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-11-06 22:47:50,939 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-11-06 22:47:50,940 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 99 flow [2023-11-06 22:47:50,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:50,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:50,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:50,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:51,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:51,152 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:51,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:51,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1359776430, now seen corresponding path program 1 times [2023-11-06 22:47:51,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:51,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198852824] [2023-11-06 22:47:51,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:51,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:51,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:51,157 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:51,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:47:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:51,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:47:51,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:51,386 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:51,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:51,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198852824] [2023-11-06 22:47:51,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198852824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:51,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:51,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:47:51,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939890341] [2023-11-06 22:47:51,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:51,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:47:51,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:51,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:47:51,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:47:51,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 296 [2023-11-06 22:47:51,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:51,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:51,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 296 [2023-11-06 22:47:51,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:51,975 INFO L124 PetriNetUnfolderBase]: 1455/2258 cut-off events. [2023-11-06 22:47:51,976 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2023-11-06 22:47:51,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5462 conditions, 2258 events. 1455/2258 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11267 event pairs, 343 based on Foata normal form. 108/2278 useless extension candidates. Maximal degree in co-relation 5457. Up to 1244 conditions per place. [2023-11-06 22:47:51,996 INFO L140 encePairwiseOnDemand]: 290/296 looper letters, 50 selfloop transitions, 9 changer transitions 0/63 dead transitions. [2023-11-06 22:47:51,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 295 flow [2023-11-06 22:47:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:47:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:47:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 576 transitions. [2023-11-06 22:47:52,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2023-11-06 22:47:52,003 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 576 transitions. [2023-11-06 22:47:52,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 576 transitions. [2023-11-06 22:47:52,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:52,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 576 transitions. [2023-11-06 22:47:52,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.0) internal successors, (576), 4 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 22:47:52,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:52,011 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:52,011 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 99 flow. Second operand 4 states and 576 transitions. [2023-11-06 22:47:52,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 295 flow [2023-11-06 22:47:52,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:47:52,021 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 146 flow [2023-11-06 22:47:52,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-11-06 22:47:52,023 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2023-11-06 22:47:52,023 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 146 flow [2023-11-06 22:47:52,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:52,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:52,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:52,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:52,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:52,236 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:52,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1293737693, now seen corresponding path program 1 times [2023-11-06 22:47:52,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:52,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609629440] [2023-11-06 22:47:52,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:52,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:52,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:52,239 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:52,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:47:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:52,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:47:52,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:52,451 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:52,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:52,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609629440] [2023-11-06 22:47:52,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609629440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:52,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:52,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:52,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184068073] [2023-11-06 22:47:52,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:52,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:47:52,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:52,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:47:52,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:47:52,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 296 [2023-11-06 22:47:52,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:52,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:52,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 296 [2023-11-06 22:47:52,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:52,940 INFO L124 PetriNetUnfolderBase]: 915/1448 cut-off events. [2023-11-06 22:47:52,940 INFO L125 PetriNetUnfolderBase]: For 975/975 co-relation queries the response was YES. [2023-11-06 22:47:52,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3985 conditions, 1448 events. 915/1448 cut-off events. For 975/975 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6828 event pairs, 277 based on Foata normal form. 54/1468 useless extension candidates. Maximal degree in co-relation 3979. Up to 540 conditions per place. [2023-11-06 22:47:52,952 INFO L140 encePairwiseOnDemand]: 290/296 looper letters, 60 selfloop transitions, 13 changer transitions 0/77 dead transitions. [2023-11-06 22:47:52,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 400 flow [2023-11-06 22:47:52,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:47:52,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:47:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 719 transitions. [2023-11-06 22:47:52,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4858108108108108 [2023-11-06 22:47:52,956 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 719 transitions. [2023-11-06 22:47:52,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 719 transitions. [2023-11-06 22:47:52,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:52,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 719 transitions. [2023-11-06 22:47:52,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:52,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:52,965 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:52,965 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 146 flow. Second operand 5 states and 719 transitions. [2023-11-06 22:47:52,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 400 flow [2023-11-06 22:47:52,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 77 transitions, 382 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:52,971 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 196 flow [2023-11-06 22:47:52,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-11-06 22:47:52,972 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-11-06 22:47:52,972 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 196 flow [2023-11-06 22:47:52,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:52,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:52,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:52,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:53,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:53,186 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:53,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:53,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1530318664, now seen corresponding path program 1 times [2023-11-06 22:47:53,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:53,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461503202] [2023-11-06 22:47:53,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:53,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:53,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:53,192 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:53,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:47:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:53,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:47:53,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:53,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:53,420 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:53,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:53,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461503202] [2023-11-06 22:47:53,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461503202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:53,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:53,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:47:53,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776159212] [2023-11-06 22:47:53,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:53,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:47:53,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:53,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:47:53,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:47:53,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 296 [2023-11-06 22:47:53,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:53,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:53,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 296 [2023-11-06 22:47:53,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:54,071 INFO L124 PetriNetUnfolderBase]: 855/1328 cut-off events. [2023-11-06 22:47:54,072 INFO L125 PetriNetUnfolderBase]: For 1117/1117 co-relation queries the response was YES. [2023-11-06 22:47:54,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3799 conditions, 1328 events. 855/1328 cut-off events. For 1117/1117 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6234 event pairs, 272 based on Foata normal form. 12/1318 useless extension candidates. Maximal degree in co-relation 3792. Up to 540 conditions per place. [2023-11-06 22:47:54,083 INFO L140 encePairwiseOnDemand]: 290/296 looper letters, 56 selfloop transitions, 17 changer transitions 0/77 dead transitions. [2023-11-06 22:47:54,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 77 transitions, 426 flow [2023-11-06 22:47:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:47:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:47:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 848 transitions. [2023-11-06 22:47:54,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2023-11-06 22:47:54,088 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 848 transitions. [2023-11-06 22:47:54,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 848 transitions. [2023-11-06 22:47:54,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:54,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 848 transitions. [2023-11-06 22:47:54,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:54,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 296.0) internal successors, (2072), 7 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:54,098 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 296.0) internal successors, (2072), 7 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:54,099 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 196 flow. Second operand 6 states and 848 transitions. [2023-11-06 22:47:54,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 77 transitions, 426 flow [2023-11-06 22:47:54,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 392 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-06 22:47:54,117 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 206 flow [2023-11-06 22:47:54,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-06 22:47:54,119 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-11-06 22:47:54,119 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 206 flow [2023-11-06 22:47:54,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:54,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:54,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:54,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:54,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:54,333 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:54,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash 899859659, now seen corresponding path program 1 times [2023-11-06 22:47:54,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:54,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727103765] [2023-11-06 22:47:54,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:54,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:54,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:54,335 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:54,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 22:47:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:47:54,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:55,354 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:55,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:55,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727103765] [2023-11-06 22:47:55,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727103765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:55,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:55,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:55,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100820567] [2023-11-06 22:47:55,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:55,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:47:55,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:55,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:47:55,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:47:55,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 296 [2023-11-06 22:47:55,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:55,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:55,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 296 [2023-11-06 22:47:55,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:56,463 INFO L124 PetriNetUnfolderBase]: 855/1361 cut-off events. [2023-11-06 22:47:56,463 INFO L125 PetriNetUnfolderBase]: For 1625/1625 co-relation queries the response was YES. [2023-11-06 22:47:56,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3905 conditions, 1361 events. 855/1361 cut-off events. For 1625/1625 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6556 event pairs, 28 based on Foata normal form. 0/1361 useless extension candidates. Maximal degree in co-relation 3897. Up to 1044 conditions per place. [2023-11-06 22:47:56,475 INFO L140 encePairwiseOnDemand]: 291/296 looper letters, 58 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2023-11-06 22:47:56,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 461 flow [2023-11-06 22:47:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:47:56,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:47:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 721 transitions. [2023-11-06 22:47:56,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40596846846846846 [2023-11-06 22:47:56,480 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 721 transitions. [2023-11-06 22:47:56,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 721 transitions. [2023-11-06 22:47:56,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:56,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 721 transitions. [2023-11-06 22:47:56,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:56,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 296.0) internal successors, (2072), 7 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:56,489 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 296.0) internal successors, (2072), 7 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:56,489 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 206 flow. Second operand 6 states and 721 transitions. [2023-11-06 22:47:56,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 461 flow [2023-11-06 22:47:56,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 386 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-11-06 22:47:56,498 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 162 flow [2023-11-06 22:47:56,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-11-06 22:47:56,499 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-11-06 22:47:56,499 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 162 flow [2023-11-06 22:47:56,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:56,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:56,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:56,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:56,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:56,719 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:56,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:56,720 INFO L85 PathProgramCache]: Analyzing trace with hash 251798751, now seen corresponding path program 1 times [2023-11-06 22:47:56,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:56,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079031838] [2023-11-06 22:47:56,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:56,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:56,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:56,723 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:56,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 22:47:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:47:56,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:57,008 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:57,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:57,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079031838] [2023-11-06 22:47:57,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079031838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:57,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:57,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:57,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229169565] [2023-11-06 22:47:57,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:57,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:47:57,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:57,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:47:57,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:47:57,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 296 [2023-11-06 22:47:57,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:57,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:57,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 296 [2023-11-06 22:47:57,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:57,671 INFO L124 PetriNetUnfolderBase]: 1507/2399 cut-off events. [2023-11-06 22:47:57,671 INFO L125 PetriNetUnfolderBase]: For 1406/1406 co-relation queries the response was YES. [2023-11-06 22:47:57,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6430 conditions, 2399 events. 1507/2399 cut-off events. For 1406/1406 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 12919 event pairs, 219 based on Foata normal form. 1/2399 useless extension candidates. Maximal degree in co-relation 6422. Up to 1150 conditions per place. [2023-11-06 22:47:57,686 INFO L140 encePairwiseOnDemand]: 292/296 looper letters, 52 selfloop transitions, 1 changer transitions 29/85 dead transitions. [2023-11-06 22:47:57,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 524 flow [2023-11-06 22:47:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:47:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:47:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 683 transitions. [2023-11-06 22:47:57,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4614864864864865 [2023-11-06 22:47:57,691 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 683 transitions. [2023-11-06 22:47:57,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 683 transitions. [2023-11-06 22:47:57,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:57,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 683 transitions. [2023-11-06 22:47:57,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:57,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:57,699 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:57,699 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 162 flow. Second operand 5 states and 683 transitions. [2023-11-06 22:47:57,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 524 flow [2023-11-06 22:47:57,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 85 transitions, 515 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:47:57,721 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 164 flow [2023-11-06 22:47:57,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-11-06 22:47:57,724 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2023-11-06 22:47:57,727 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 164 flow [2023-11-06 22:47:57,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:57,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:57,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:57,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:57,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:57,947 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:57,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:57,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1766071803, now seen corresponding path program 2 times [2023-11-06 22:47:57,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:57,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234557452] [2023-11-06 22:47:57,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:47:57,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:57,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:57,955 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:57,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 22:47:58,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:47:58,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:47:58,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:47:58,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:58,590 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:58,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:58,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234557452] [2023-11-06 22:47:58,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234557452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:58,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:58,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:58,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304245239] [2023-11-06 22:47:58,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:58,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:47:58,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:58,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:47:58,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:47:58,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 296 [2023-11-06 22:47:58,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:58,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:58,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 296 [2023-11-06 22:47:58,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:59,094 INFO L124 PetriNetUnfolderBase]: 1434/2232 cut-off events. [2023-11-06 22:47:59,095 INFO L125 PetriNetUnfolderBase]: For 1661/1663 co-relation queries the response was YES. [2023-11-06 22:47:59,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6237 conditions, 2232 events. 1434/2232 cut-off events. For 1661/1663 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11421 event pairs, 371 based on Foata normal form. 2/2193 useless extension candidates. Maximal degree in co-relation 6226. Up to 1333 conditions per place. [2023-11-06 22:47:59,108 INFO L140 encePairwiseOnDemand]: 292/296 looper letters, 50 selfloop transitions, 1 changer transitions 33/87 dead transitions. [2023-11-06 22:47:59,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 87 transitions, 541 flow [2023-11-06 22:47:59,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:47:59,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:47:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions. [2023-11-06 22:47:59,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46283783783783783 [2023-11-06 22:47:59,112 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 685 transitions. [2023-11-06 22:47:59,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 685 transitions. [2023-11-06 22:47:59,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:59,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 685 transitions. [2023-11-06 22:47:59,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:59,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:59,119 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:59,119 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 164 flow. Second operand 5 states and 685 transitions. [2023-11-06 22:47:59,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 87 transitions, 541 flow [2023-11-06 22:47:59,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 87 transitions, 532 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 22:47:59,145 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 168 flow [2023-11-06 22:47:59,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2023-11-06 22:47:59,146 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2023-11-06 22:47:59,146 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 168 flow [2023-11-06 22:47:59,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:59,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:59,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:59,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:59,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:59,359 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:59,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:59,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2087914647, now seen corresponding path program 3 times [2023-11-06 22:47:59,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:59,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53918172] [2023-11-06 22:47:59,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:47:59,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:59,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:59,363 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:59,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 22:47:59,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:47:59,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:47:59,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:47:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:47:59,785 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:47:59,786 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:47:59,787 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:47:59,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:47:59,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:47:59,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:47:59,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:47:59,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:47:59,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:47:59,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:47:59,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:47:59,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:47:59,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:47:59,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:47:59,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:47:59,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:47:59,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:47:59,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:47:59,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:00,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:00,014 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:00,019 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:48:00,019 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:48:00,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:48:00 BasicIcfg [2023-11-06 22:48:00,156 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:48:00,157 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:48:00,157 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:48:00,157 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:48:00,158 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:33" (3/4) ... [2023-11-06 22:48:00,160 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:48:00,161 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:48:00,161 INFO L158 Benchmark]: Toolchain (without parser) took 28532.05ms. Allocated memory was 98.6MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 74.0MB in the beginning and 810.7MB in the end (delta: -736.7MB). Peak memory consumption was 283.3MB. Max. memory is 16.1GB. [2023-11-06 22:48:00,162 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 73.4MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:48:00,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 810.48ms. Allocated memory is still 98.6MB. Free memory was 73.8MB in the beginning and 72.5MB in the end (delta: 1.3MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2023-11-06 22:48:00,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.16ms. Allocated memory is still 98.6MB. Free memory was 72.5MB in the beginning and 69.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:48:00,163 INFO L158 Benchmark]: Boogie Preprocessor took 53.32ms. Allocated memory is still 98.6MB. Free memory was 69.6MB in the beginning and 67.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:48:00,164 INFO L158 Benchmark]: RCFGBuilder took 1021.06ms. Allocated memory is still 98.6MB. Free memory was 67.1MB in the beginning and 45.6MB in the end (delta: 21.6MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2023-11-06 22:48:00,164 INFO L158 Benchmark]: TraceAbstraction took 26558.55ms. Allocated memory was 98.6MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 45.1MB in the beginning and 810.7MB in the end (delta: -765.6MB). Peak memory consumption was 251.9MB. Max. memory is 16.1GB. [2023-11-06 22:48:00,165 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 1.1GB. Free memory is still 810.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:48:00,167 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 73.4MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 810.48ms. Allocated memory is still 98.6MB. Free memory was 73.8MB in the beginning and 72.5MB in the end (delta: 1.3MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.16ms. Allocated memory is still 98.6MB. Free memory was 72.5MB in the beginning and 69.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.32ms. Allocated memory is still 98.6MB. Free memory was 69.6MB in the beginning and 67.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1021.06ms. Allocated memory is still 98.6MB. Free memory was 67.1MB in the beginning and 45.6MB in the end (delta: 21.6MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * TraceAbstraction took 26558.55ms. Allocated memory was 98.6MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 45.1MB in the beginning and 810.7MB in the end (delta: -765.6MB). Peak memory consumption was 251.9MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 1.1GB. Free memory is still 810.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: 11.1s, 156 PlacesBefore, 53 PlacesAfterwards, 146 TransitionsBefore, 41 TransitionsAfterwards, 3916 CoEnabledTransitionPairs, 6 FixpointIterations, 51 TrivialSequentialCompositions, 82 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 146 TotalNumberOfCompositions, 9819 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4351, independent: 4152, independent conditional: 0, independent unconditional: 4152, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2058, independent: 2020, independent conditional: 0, independent unconditional: 2020, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4351, independent: 2132, independent conditional: 0, independent unconditional: 2132, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 2058, unknown conditional: 0, unknown unconditional: 2058] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 154, Positive conditional cache size: 0, Positive unconditional cache size: 154, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1377, ((void *)0), P0, ((void *)0))=0, t1377={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1378, ((void *)0), P1, ((void *)0))=1, t1377={3:0}, t1378={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1379; [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1379, ((void *)0), P2, ((void *)0))=2, t1377={3:0}, t1378={7:0}, t1379={11:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1380, ((void *)0), P3, ((void *)0))=3, t1377={3:0}, t1378={7:0}, t1379={11:0}, t1380={15:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377={3:0}, t1378={7:0}, t1379={11:0}, t1380={15:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 [L883] 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", "mix051_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={5:6}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 855]: 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: 849]: 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: 851]: 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 9 procedures, 185 locations, 16 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: 26.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 333 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 259 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1452 IncrementalHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 25 mSDtfsCounter, 1452 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=6, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 1402 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1329 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:48:00,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb12cd3-db6c-46a0-b58d-5880a085c94b/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