./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix017.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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 a97b4f259d777d70ea3df756a2f94b2605f52fea9df0872361c6911477a44448 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:15:45,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:15:45,626 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:15:45,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:15:45,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:15:45,693 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:15:45,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:15:45,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:15:45,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:15:45,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:15:45,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:15:45,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:15:45,705 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:15:45,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:15:45,708 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:15:45,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:15:45,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:15:45,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:15:45,710 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:15:45,710 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:15:45,711 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:15:45,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:15:45,712 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:15:45,712 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:15:45,713 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:15:45,713 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:15:45,716 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:15:45,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:15:45,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:15:45,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:15:45,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:15:45,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:15:45,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:15:45,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:15:45,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:15:45,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:15:45,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:15:45,721 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:15:45,721 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_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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 -> a97b4f259d777d70ea3df756a2f94b2605f52fea9df0872361c6911477a44448 [2023-11-06 22:15:46,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:15:46,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:15:46,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:15:46,220 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:15:46,221 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:15:46,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix017.oepc.i [2023-11-06 22:15:49,982 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:15:50,350 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:15:50,351 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/sv-benchmarks/c/pthread-wmm/mix017.oepc.i [2023-11-06 22:15:50,376 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/data/e2f5c8aa0/e385be731014421290fcc6a0026e9b44/FLAG2e8e75e8b [2023-11-06 22:15:50,395 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/data/e2f5c8aa0/e385be731014421290fcc6a0026e9b44 [2023-11-06 22:15:50,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:15:50,400 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:15:50,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:15:50,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:15:50,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:15:50,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:50" (1/1) ... [2023-11-06 22:15:50,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3481c997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:50, skipping insertion in model container [2023-11-06 22:15:50,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:50" (1/1) ... [2023-11-06 22:15:50,489 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:15:51,040 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:15:51,062 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:15:51,211 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:15:51,270 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:15:51,270 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:15:51,280 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:15:51,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:51 WrapperNode [2023-11-06 22:15:51,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:15:51,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:15:51,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:15:51,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:15:51,295 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:15:51" (1/1) ... [2023-11-06 22:15:51,348 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:15:51" (1/1) ... [2023-11-06 22:15:51,414 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-06 22:15:51,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:15:51,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:15:51,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:15:51,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:15:51,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:51" (1/1) ... [2023-11-06 22:15:51,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:51" (1/1) ... [2023-11-06 22:15:51,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:51" (1/1) ... [2023-11-06 22:15:51,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:51" (1/1) ... [2023-11-06 22:15:51,472 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:51" (1/1) ... [2023-11-06 22:15:51,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:51" (1/1) ... [2023-11-06 22:15:51,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:51" (1/1) ... [2023-11-06 22:15:51,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:51" (1/1) ... [2023-11-06 22:15:51,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:15:51,488 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:15:51,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:15:51,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:15:51,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:51" (1/1) ... [2023-11-06 22:15:51,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:15:51,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:15:51,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:15:51,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:15:51,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:15:51,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:15:51,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:15:51,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:15:51,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:15:51,635 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:15:51,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:15:51,636 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:15:51,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:15:51,636 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:15:51,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:15:51,637 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:15:51,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:15:51,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:15:51,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:15:51,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:15:51,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:15:51,642 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:15:51,884 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:15:51,886 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:15:52,421 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:15:52,662 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:15:52,662 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:15:52,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:52 BoogieIcfgContainer [2023-11-06 22:15:52,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:15:52,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:15:52,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:15:52,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:15:52,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:15:50" (1/3) ... [2023-11-06 22:15:52,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b83941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:52, skipping insertion in model container [2023-11-06 22:15:52,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:51" (2/3) ... [2023-11-06 22:15:52,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b83941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:52, skipping insertion in model container [2023-11-06 22:15:52,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:52" (3/3) ... [2023-11-06 22:15:52,678 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017.oepc.i [2023-11-06 22:15:52,702 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:15:52,703 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:15:52,703 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:15:52,858 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:15:52,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 152 transitions, 320 flow [2023-11-06 22:15:53,083 INFO L124 PetriNetUnfolderBase]: 3/148 cut-off events. [2023-11-06 22:15:53,083 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:15:53,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 3/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 117 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-06 22:15:53,093 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 152 transitions, 320 flow [2023-11-06 22:15:53,101 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 148 transitions, 308 flow [2023-11-06 22:15:53,105 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:15:53,119 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 148 transitions, 308 flow [2023-11-06 22:15:53,123 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 148 transitions, 308 flow [2023-11-06 22:15:53,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 148 transitions, 308 flow [2023-11-06 22:15:53,176 INFO L124 PetriNetUnfolderBase]: 3/148 cut-off events. [2023-11-06 22:15:53,177 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:15:53,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 3/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 116 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-06 22:15:53,183 INFO L119 LiptonReduction]: Number of co-enabled transitions 4064 [2023-11-06 22:16:00,750 INFO L134 LiptonReduction]: Checked pairs total: 11476 [2023-11-06 22:16:00,750 INFO L136 LiptonReduction]: Total number of compositions: 143 [2023-11-06 22:16:00,774 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:16:00,782 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;@2d277436, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:16:00,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:16:00,785 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:16:00,785 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:16:00,786 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:16:00,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:00,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:16:00,788 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:00,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:00,795 INFO L85 PathProgramCache]: Analyzing trace with hash 656, now seen corresponding path program 1 times [2023-11-06 22:16:00,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:00,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639140572] [2023-11-06 22:16:00,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:00,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:00,987 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:16:00,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:00,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639140572] [2023-11-06 22:16:00,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639140572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:00,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:00,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:16:00,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785937836] [2023-11-06 22:16:00,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:01,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:16:01,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:01,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:16:01,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:16:01,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 295 [2023-11-06 22:16:01,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have 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:16:01,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:01,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 295 [2023-11-06 22:16:01,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:03,790 INFO L124 PetriNetUnfolderBase]: 8719/11815 cut-off events. [2023-11-06 22:16:03,792 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-11-06 22:16:03,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23763 conditions, 11815 events. 8719/11815 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 61246 event pairs, 8719 based on Foata normal form. 0/10313 useless extension candidates. Maximal degree in co-relation 23751. Up to 11731 conditions per place. [2023-11-06 22:16:03,931 INFO L140 encePairwiseOnDemand]: 286/295 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-11-06 22:16:03,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2023-11-06 22:16:03,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:16:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:16:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2023-11-06 22:16:03,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.523728813559322 [2023-11-06 22:16:03,963 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2023-11-06 22:16:03,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2023-11-06 22:16:03,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:03,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2023-11-06 22:16:03,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have 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:16:03,993 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:16:03,995 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:16:03,997 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 309 transitions. [2023-11-06 22:16:03,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2023-11-06 22:16:04,011 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:16:04,014 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-11-06 22:16:04,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, 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:16:04,023 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-11-06 22:16:04,024 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-11-06 22:16:04,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have 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:16:04,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:04,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:16:04,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:16:04,026 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:04,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash 643789, now seen corresponding path program 1 times [2023-11-06 22:16:04,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:04,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070169312] [2023-11-06 22:16:04,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:04,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:04,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:16:04,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:04,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070169312] [2023-11-06 22:16:04,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070169312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:04,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:04,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:16:04,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925074159] [2023-11-06 22:16:04,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:04,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:16:04,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:04,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:16:04,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:16:04,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 295 [2023-11-06 22:16:04,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have 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:16:04,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:04,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 295 [2023-11-06 22:16:04,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:06,446 INFO L124 PetriNetUnfolderBase]: 6855/9883 cut-off events. [2023-11-06 22:16:06,446 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:16:06,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19320 conditions, 9883 events. 6855/9883 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 60007 event pairs, 1263 based on Foata normal form. 0/9223 useless extension candidates. Maximal degree in co-relation 19317. Up to 7399 conditions per place. [2023-11-06 22:16:06,545 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-11-06 22:16:06,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2023-11-06 22:16:06,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:16:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:16:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2023-11-06 22:16:06,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5141242937853108 [2023-11-06 22:16:06,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2023-11-06 22:16:06,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2023-11-06 22:16:06,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:06,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2023-11-06 22:16:06,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have 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:16:06,558 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:16:06,560 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:16:06,560 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 455 transitions. [2023-11-06 22:16:06,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2023-11-06 22:16:06,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:16:06,563 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-11-06 22:16:06,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, 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=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-11-06 22:16:06,565 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-11-06 22:16:06,565 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-11-06 22:16:06,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have 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:16:06,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:06,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:06,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:16:06,567 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:06,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:06,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2129786553, now seen corresponding path program 1 times [2023-11-06 22:16:06,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:06,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493047752] [2023-11-06 22:16:06,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:06,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:06,957 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:16:06,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:06,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493047752] [2023-11-06 22:16:06,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493047752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:06,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:06,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:16:06,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774311655] [2023-11-06 22:16:06,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:06,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:16:06,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:06,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:16:06,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:16:06,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 295 [2023-11-06 22:16:06,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have 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:16:06,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:06,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 295 [2023-11-06 22:16:06,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:10,815 INFO L124 PetriNetUnfolderBase]: 18413/24676 cut-off events. [2023-11-06 22:16:10,815 INFO L125 PetriNetUnfolderBase]: For 1237/1237 co-relation queries the response was YES. [2023-11-06 22:16:10,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50907 conditions, 24676 events. 18413/24676 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 126709 event pairs, 7997 based on Foata normal form. 0/23942 useless extension candidates. Maximal degree in co-relation 50903. Up to 19535 conditions per place. [2023-11-06 22:16:11,004 INFO L140 encePairwiseOnDemand]: 287/295 looper letters, 50 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2023-11-06 22:16:11,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 248 flow [2023-11-06 22:16:11,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:16:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:16:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-11-06 22:16:11,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496045197740113 [2023-11-06 22:16:11,009 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-11-06 22:16:11,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-11-06 22:16:11,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:11,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-11-06 22:16:11,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have 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:16:11,016 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:16:11,018 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:16:11,018 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 439 transitions. [2023-11-06 22:16:11,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 57 transitions, 248 flow [2023-11-06 22:16:11,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:16:11,022 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 122 flow [2023-11-06 22:16:11,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-11-06 22:16:11,024 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -9 predicate places. [2023-11-06 22:16:11,024 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 122 flow [2023-11-06 22:16:11,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have 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:16:11,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:11,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:11,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:16:11,026 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:11,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:11,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1598872738, now seen corresponding path program 1 times [2023-11-06 22:16:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:11,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448633528] [2023-11-06 22:16:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:11,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:12,234 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:16:12,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:12,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448633528] [2023-11-06 22:16:12,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448633528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:12,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:12,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:16:12,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069392540] [2023-11-06 22:16:12,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:12,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:16:12,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:12,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:16:12,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:16:12,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 295 [2023-11-06 22:16:12,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 122 flow. Second operand has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have 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:16:12,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:12,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 295 [2023-11-06 22:16:12,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:15,717 INFO L124 PetriNetUnfolderBase]: 13783/19426 cut-off events. [2023-11-06 22:16:15,717 INFO L125 PetriNetUnfolderBase]: For 2735/2781 co-relation queries the response was YES. [2023-11-06 22:16:15,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43590 conditions, 19426 events. 13783/19426 cut-off events. For 2735/2781 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 110224 event pairs, 2246 based on Foata normal form. 1032/20217 useless extension candidates. Maximal degree in co-relation 43585. Up to 12994 conditions per place. [2023-11-06 22:16:15,868 INFO L140 encePairwiseOnDemand]: 287/295 looper letters, 52 selfloop transitions, 6 changer transitions 17/81 dead transitions. [2023-11-06 22:16:15,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 81 transitions, 374 flow [2023-11-06 22:16:15,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:16:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:16:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 899 transitions. [2023-11-06 22:16:15,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4353510895883777 [2023-11-06 22:16:15,875 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 899 transitions. [2023-11-06 22:16:15,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 899 transitions. [2023-11-06 22:16:15,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:15,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 899 transitions. [2023-11-06 22:16:15,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.42857142857142) internal successors, (899), 7 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have 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:16:15,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have 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:16:15,888 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have 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:16:15,888 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 122 flow. Second operand 7 states and 899 transitions. [2023-11-06 22:16:15,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 81 transitions, 374 flow [2023-11-06 22:16:16,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:16:16,012 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 125 flow [2023-11-06 22:16:16,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=125, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2023-11-06 22:16:16,015 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2023-11-06 22:16:16,015 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 125 flow [2023-11-06 22:16:16,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have 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:16:16,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:16,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:16:16,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:16:16,018 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:16,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:16,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1939650720, now seen corresponding path program 1 times [2023-11-06 22:16:16,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:16,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713449453] [2023-11-06 22:16:16,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:16,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:16,240 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:16:16,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:16,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713449453] [2023-11-06 22:16:16,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713449453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:16,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:16,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:16:16,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358138654] [2023-11-06 22:16:16,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:16,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:16:16,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:16,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:16:16,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:16:16,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 295 [2023-11-06 22:16:16,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have 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:16:16,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:16,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 295 [2023-11-06 22:16:16,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:18,118 INFO L124 PetriNetUnfolderBase]: 7714/11422 cut-off events. [2023-11-06 22:16:18,118 INFO L125 PetriNetUnfolderBase]: For 1606/1757 co-relation queries the response was YES. [2023-11-06 22:16:18,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25848 conditions, 11422 events. 7714/11422 cut-off events. For 1606/1757 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 67416 event pairs, 1622 based on Foata normal form. 602/11504 useless extension candidates. Maximal degree in co-relation 25841. Up to 8180 conditions per place. [2023-11-06 22:16:18,375 INFO L140 encePairwiseOnDemand]: 288/295 looper letters, 58 selfloop transitions, 9 changer transitions 6/81 dead transitions. [2023-11-06 22:16:18,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 81 transitions, 382 flow [2023-11-06 22:16:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:16:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:16:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 719 transitions. [2023-11-06 22:16:18,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48745762711864404 [2023-11-06 22:16:18,383 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 719 transitions. [2023-11-06 22:16:18,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 719 transitions. [2023-11-06 22:16:18,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:18,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 719 transitions. [2023-11-06 22:16:18,387 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:16:18,392 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:16:18,394 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:16:18,394 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 125 flow. Second operand 5 states and 719 transitions. [2023-11-06 22:16:18,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 81 transitions, 382 flow [2023-11-06 22:16:18,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 81 transitions, 362 flow, removed 1 selfloop flow, removed 6 redundant places. [2023-11-06 22:16:18,434 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 180 flow [2023-11-06 22:16:18,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-11-06 22:16:18,437 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2023-11-06 22:16:18,437 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 180 flow [2023-11-06 22:16:18,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have 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:16:18,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:18,438 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:16:18,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:16:18,439 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:18,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:18,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1292142112, now seen corresponding path program 1 times [2023-11-06 22:16:18,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:18,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011725773] [2023-11-06 22:16:18,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:18,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:18,719 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:16:18,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:18,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011725773] [2023-11-06 22:16:18,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011725773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:18,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:18,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:16:18,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370862088] [2023-11-06 22:16:18,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:18,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:16:18,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:18,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:16:18,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:16:18,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 295 [2023-11-06 22:16:18,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have 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:16:18,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:18,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 295 [2023-11-06 22:16:18,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:19,823 INFO L124 PetriNetUnfolderBase]: 4501/7013 cut-off events. [2023-11-06 22:16:19,823 INFO L125 PetriNetUnfolderBase]: For 3394/3491 co-relation queries the response was YES. [2023-11-06 22:16:19,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19658 conditions, 7013 events. 4501/7013 cut-off events. For 3394/3491 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 41623 event pairs, 750 based on Foata normal form. 385/7162 useless extension candidates. Maximal degree in co-relation 19649. Up to 2160 conditions per place. [2023-11-06 22:16:19,868 INFO L140 encePairwiseOnDemand]: 288/295 looper letters, 85 selfloop transitions, 18 changer transitions 0/111 dead transitions. [2023-11-06 22:16:19,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 111 transitions, 594 flow [2023-11-06 22:16:19,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:16:19,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:16:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1007 transitions. [2023-11-06 22:16:19,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48765133171912833 [2023-11-06 22:16:19,874 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1007 transitions. [2023-11-06 22:16:19,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1007 transitions. [2023-11-06 22:16:19,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:19,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1007 transitions. [2023-11-06 22:16:19,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.85714285714286) internal successors, (1007), 7 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have 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:16:19,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have 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:16:19,885 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have 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:16:19,886 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 180 flow. Second operand 7 states and 1007 transitions. [2023-11-06 22:16:19,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 111 transitions, 594 flow [2023-11-06 22:16:19,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 111 transitions, 589 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:16:19,911 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 306 flow [2023-11-06 22:16:19,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=306, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2023-11-06 22:16:19,912 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2023-11-06 22:16:19,912 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 306 flow [2023-11-06 22:16:19,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have 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:16:19,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:19,913 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:16:19,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:16:19,914 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:19,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:19,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1815428234, now seen corresponding path program 1 times [2023-11-06 22:16:19,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:19,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372765433] [2023-11-06 22:16:19,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:19,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:21,491 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:16:21,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:21,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372765433] [2023-11-06 22:16:21,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372765433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:21,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:21,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:16:21,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840859468] [2023-11-06 22:16:21,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:21,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:16:21,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:21,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:16:21,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:16:21,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 295 [2023-11-06 22:16:21,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 306 flow. Second operand has 8 states, 8 states have (on average 132.25) internal successors, (1058), 8 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have 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:16:21,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:21,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 295 [2023-11-06 22:16:21,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:23,939 INFO L124 PetriNetUnfolderBase]: 8977/14587 cut-off events. [2023-11-06 22:16:23,939 INFO L125 PetriNetUnfolderBase]: For 29938/30327 co-relation queries the response was YES. [2023-11-06 22:16:24,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52306 conditions, 14587 events. 8977/14587 cut-off events. For 29938/30327 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 103536 event pairs, 1025 based on Foata normal form. 4/14236 useless extension candidates. Maximal degree in co-relation 52294. Up to 5324 conditions per place. [2023-11-06 22:16:24,069 INFO L140 encePairwiseOnDemand]: 287/295 looper letters, 219 selfloop transitions, 14 changer transitions 10/251 dead transitions. [2023-11-06 22:16:24,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 251 transitions, 2129 flow [2023-11-06 22:16:24,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:16:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:16:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1171 transitions. [2023-11-06 22:16:24,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4961864406779661 [2023-11-06 22:16:24,077 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1171 transitions. [2023-11-06 22:16:24,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1171 transitions. [2023-11-06 22:16:24,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:24,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1171 transitions. [2023-11-06 22:16:24,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 146.375) internal successors, (1171), 8 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have 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:16:24,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 295.0) internal successors, (2655), 9 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have 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:16:24,092 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 295.0) internal successors, (2655), 9 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have 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:16:24,092 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 306 flow. Second operand 8 states and 1171 transitions. [2023-11-06 22:16:24,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 251 transitions, 2129 flow [2023-11-06 22:16:24,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 251 transitions, 1820 flow, removed 111 selfloop flow, removed 3 redundant places. [2023-11-06 22:16:24,840 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 368 flow [2023-11-06 22:16:24,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=368, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2023-11-06 22:16:24,842 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2023-11-06 22:16:24,842 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 368 flow [2023-11-06 22:16:24,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 132.25) internal successors, (1058), 8 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have 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:16:24,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:24,843 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:16:24,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:16:24,844 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:24,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:24,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1557941138, now seen corresponding path program 2 times [2023-11-06 22:16:24,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:24,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918375601] [2023-11-06 22:16:24,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:24,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:25,280 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:16:25,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:25,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918375601] [2023-11-06 22:16:25,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918375601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:25,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:25,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:16:25,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997745043] [2023-11-06 22:16:25,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:25,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:16:25,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:25,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:16:25,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:16:25,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 295 [2023-11-06 22:16:25,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have 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:16:25,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:25,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 295 [2023-11-06 22:16:25,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:27,399 INFO L124 PetriNetUnfolderBase]: 7069/11462 cut-off events. [2023-11-06 22:16:27,399 INFO L125 PetriNetUnfolderBase]: For 20963/21113 co-relation queries the response was YES. [2023-11-06 22:16:27,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41807 conditions, 11462 events. 7069/11462 cut-off events. For 20963/21113 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 79465 event pairs, 654 based on Foata normal form. 367/11641 useless extension candidates. Maximal degree in co-relation 41790. Up to 2548 conditions per place. [2023-11-06 22:16:27,499 INFO L140 encePairwiseOnDemand]: 288/295 looper letters, 186 selfloop transitions, 27 changer transitions 32/253 dead transitions. [2023-11-06 22:16:27,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 253 transitions, 1778 flow [2023-11-06 22:16:27,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:16:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:16:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1294 transitions. [2023-11-06 22:16:27,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4873822975517891 [2023-11-06 22:16:27,507 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1294 transitions. [2023-11-06 22:16:27,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1294 transitions. [2023-11-06 22:16:27,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:27,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1294 transitions. [2023-11-06 22:16:27,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 143.77777777777777) internal successors, (1294), 9 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have 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:16:27,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 295.0) internal successors, (2950), 10 states have internal predecessors, (2950), 0 states have call successors, (0), 0 states have 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:16:27,521 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 295.0) internal successors, (2950), 10 states have internal predecessors, (2950), 0 states have call successors, (0), 0 states have 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:16:27,521 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 368 flow. Second operand 9 states and 1294 transitions. [2023-11-06 22:16:27,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 253 transitions, 1778 flow [2023-11-06 22:16:28,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 253 transitions, 1778 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:16:28,220 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 544 flow [2023-11-06 22:16:28,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=544, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2023-11-06 22:16:28,221 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2023-11-06 22:16:28,221 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 544 flow [2023-11-06 22:16:28,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have 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:16:28,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:28,222 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] [2023-11-06 22:16:28,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:16:28,223 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:28,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:28,223 INFO L85 PathProgramCache]: Analyzing trace with hash 366814082, now seen corresponding path program 1 times [2023-11-06 22:16:28,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:28,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076906952] [2023-11-06 22:16:28,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:28,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:28,536 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:16:28,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:28,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076906952] [2023-11-06 22:16:28,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076906952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:28,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:28,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:16:28,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767277861] [2023-11-06 22:16:28,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:28,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:16:28,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:28,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:16:28,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:16:28,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 295 [2023-11-06 22:16:28,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 544 flow. Second operand has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have 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:16:28,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:28,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 295 [2023-11-06 22:16:28,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:31,207 INFO L124 PetriNetUnfolderBase]: 10974/17997 cut-off events. [2023-11-06 22:16:31,207 INFO L125 PetriNetUnfolderBase]: For 59208/59828 co-relation queries the response was YES. [2023-11-06 22:16:31,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73568 conditions, 17997 events. 10974/17997 cut-off events. For 59208/59828 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 135893 event pairs, 1887 based on Foata normal form. 31/17745 useless extension candidates. Maximal degree in co-relation 73547. Up to 8345 conditions per place. [2023-11-06 22:16:31,364 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 159 selfloop transitions, 3 changer transitions 11/179 dead transitions. [2023-11-06 22:16:31,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 179 transitions, 1677 flow [2023-11-06 22:16:31,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:16:31,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:16:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 591 transitions. [2023-11-06 22:16:31,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008474576271187 [2023-11-06 22:16:31,368 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 591 transitions. [2023-11-06 22:16:31,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 591 transitions. [2023-11-06 22:16:31,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:31,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 591 transitions. [2023-11-06 22:16:31,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have 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:16:31,375 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:16:31,376 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:16:31,376 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 544 flow. Second operand 4 states and 591 transitions. [2023-11-06 22:16:31,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 179 transitions, 1677 flow [2023-11-06 22:16:33,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 179 transitions, 1416 flow, removed 94 selfloop flow, removed 4 redundant places. [2023-11-06 22:16:33,780 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 466 flow [2023-11-06 22:16:33,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=466, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2023-11-06 22:16:33,782 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2023-11-06 22:16:33,782 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 466 flow [2023-11-06 22:16:33,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have 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:16:33,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:33,783 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:16:33,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:16:33,783 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:33,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:33,784 INFO L85 PathProgramCache]: Analyzing trace with hash -970535091, now seen corresponding path program 1 times [2023-11-06 22:16:33,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:33,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136843415] [2023-11-06 22:16:33,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:33,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:34,943 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:16:34,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:34,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136843415] [2023-11-06 22:16:34,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136843415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:34,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:34,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:16:34,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700487102] [2023-11-06 22:16:34,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:34,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:16:34,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:34,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:16:34,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:16:35,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 295 [2023-11-06 22:16:35,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 466 flow. Second operand has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have 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:16:35,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:35,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 295 [2023-11-06 22:16:35,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:37,925 INFO L124 PetriNetUnfolderBase]: 11696/19832 cut-off events. [2023-11-06 22:16:37,925 INFO L125 PetriNetUnfolderBase]: For 40802/41690 co-relation queries the response was YES. [2023-11-06 22:16:38,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74649 conditions, 19832 events. 11696/19832 cut-off events. For 40802/41690 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 159877 event pairs, 2267 based on Foata normal form. 287/19774 useless extension candidates. Maximal degree in co-relation 74625. Up to 5138 conditions per place. [2023-11-06 22:16:38,111 INFO L140 encePairwiseOnDemand]: 288/295 looper letters, 207 selfloop transitions, 17 changer transitions 9/243 dead transitions. [2023-11-06 22:16:38,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 243 transitions, 1987 flow [2023-11-06 22:16:38,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:16:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:16:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1005 transitions. [2023-11-06 22:16:38,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48668280871670705 [2023-11-06 22:16:38,116 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1005 transitions. [2023-11-06 22:16:38,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1005 transitions. [2023-11-06 22:16:38,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:38,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1005 transitions. [2023-11-06 22:16:38,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.57142857142858) internal successors, (1005), 7 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have 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:16:38,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have 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:16:38,126 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have 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:16:38,127 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 466 flow. Second operand 7 states and 1005 transitions. [2023-11-06 22:16:38,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 243 transitions, 1987 flow [2023-11-06 22:16:41,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 243 transitions, 1982 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:16:41,524 INFO L231 Difference]: Finished difference. Result has 88 places, 94 transitions, 667 flow [2023-11-06 22:16:41,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=667, PETRI_PLACES=88, PETRI_TRANSITIONS=94} [2023-11-06 22:16:41,527 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2023-11-06 22:16:41,527 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 94 transitions, 667 flow [2023-11-06 22:16:41,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have 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:16:41,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:41,528 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:16:41,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:16:41,529 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:41,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:41,530 INFO L85 PathProgramCache]: Analyzing trace with hash -880893751, now seen corresponding path program 2 times [2023-11-06 22:16:41,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:41,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145682100] [2023-11-06 22:16:41,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:41,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:41,791 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:16:41,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:41,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145682100] [2023-11-06 22:16:41,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145682100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:41,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:41,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:16:41,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654208543] [2023-11-06 22:16:41,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:41,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:16:41,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:41,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:16:41,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:16:41,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 295 [2023-11-06 22:16:41,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 94 transitions, 667 flow. Second operand has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have 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:16:41,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:41,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 295 [2023-11-06 22:16:41,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:45,656 INFO L124 PetriNetUnfolderBase]: 18082/29877 cut-off events. [2023-11-06 22:16:45,656 INFO L125 PetriNetUnfolderBase]: For 84784/86700 co-relation queries the response was YES. [2023-11-06 22:16:45,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122086 conditions, 29877 events. 18082/29877 cut-off events. For 84784/86700 co-relation queries the response was YES. Maximal size of possible extension queue 1472. Compared 244416 event pairs, 4497 based on Foata normal form. 244/29682 useless extension candidates. Maximal degree in co-relation 122058. Up to 15132 conditions per place. [2023-11-06 22:16:45,942 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 198 selfloop transitions, 3 changer transitions 1/210 dead transitions. [2023-11-06 22:16:45,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 210 transitions, 1917 flow [2023-11-06 22:16:45,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:16:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:16:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 595 transitions. [2023-11-06 22:16:45,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042372881355932 [2023-11-06 22:16:45,945 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 595 transitions. [2023-11-06 22:16:45,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 595 transitions. [2023-11-06 22:16:45,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:45,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 595 transitions. [2023-11-06 22:16:45,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have 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:16:45,952 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:16:45,953 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:16:45,953 INFO L175 Difference]: Start difference. First operand has 88 places, 94 transitions, 667 flow. Second operand 4 states and 595 transitions. [2023-11-06 22:16:45,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 210 transitions, 1917 flow [2023-11-06 22:16:51,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 210 transitions, 1916 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:16:51,934 INFO L231 Difference]: Finished difference. Result has 92 places, 96 transitions, 691 flow [2023-11-06 22:16:51,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=691, PETRI_PLACES=92, PETRI_TRANSITIONS=96} [2023-11-06 22:16:51,935 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 39 predicate places. [2023-11-06 22:16:51,935 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 96 transitions, 691 flow [2023-11-06 22:16:51,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have 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:16:51,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:16:51,935 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:16:51,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:16:51,936 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:16:51,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:16:51,936 INFO L85 PathProgramCache]: Analyzing trace with hash 950037031, now seen corresponding path program 3 times [2023-11-06 22:16:51,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:16:51,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886685967] [2023-11-06 22:16:51,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:16:51,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:16:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:16:52,254 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:16:52,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:16:52,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886685967] [2023-11-06 22:16:52,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886685967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:16:52,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:16:52,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:16:52,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287553112] [2023-11-06 22:16:52,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:16:52,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:16:52,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:16:52,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:16:52,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:16:52,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 295 [2023-11-06 22:16:52,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 96 transitions, 691 flow. Second operand has 7 states, 7 states have (on average 132.0) internal successors, (924), 7 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have 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:16:52,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:16:52,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 295 [2023-11-06 22:16:52,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:16:57,460 INFO L124 PetriNetUnfolderBase]: 16666/27652 cut-off events. [2023-11-06 22:16:57,460 INFO L125 PetriNetUnfolderBase]: For 80219/80600 co-relation queries the response was YES. [2023-11-06 22:16:57,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114931 conditions, 27652 events. 16666/27652 cut-off events. For 80219/80600 co-relation queries the response was YES. Maximal size of possible extension queue 1581. Compared 231550 event pairs, 1170 based on Foata normal form. 341/27522 useless extension candidates. Maximal degree in co-relation 114901. Up to 5998 conditions per place. [2023-11-06 22:16:57,818 INFO L140 encePairwiseOnDemand]: 288/295 looper letters, 206 selfloop transitions, 31 changer transitions 39/288 dead transitions. [2023-11-06 22:16:57,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 288 transitions, 2501 flow [2023-11-06 22:16:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:16:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 22:16:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1552 transitions. [2023-11-06 22:16:57,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782742681047766 [2023-11-06 22:16:57,825 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1552 transitions. [2023-11-06 22:16:57,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1552 transitions. [2023-11-06 22:16:57,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:16:57,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1552 transitions. [2023-11-06 22:16:57,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 141.0909090909091) internal successors, (1552), 11 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have 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:16:57,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 295.0) internal successors, (3540), 12 states have internal predecessors, (3540), 0 states have call successors, (0), 0 states have 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:16:57,840 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 295.0) internal successors, (3540), 12 states have internal predecessors, (3540), 0 states have call successors, (0), 0 states have 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:16:57,840 INFO L175 Difference]: Start difference. First operand has 92 places, 96 transitions, 691 flow. Second operand 11 states and 1552 transitions. [2023-11-06 22:16:57,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 288 transitions, 2501 flow [2023-11-06 22:17:05,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 288 transitions, 2416 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-11-06 22:17:05,391 INFO L231 Difference]: Finished difference. Result has 102 places, 86 transitions, 684 flow [2023-11-06 22:17:05,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=684, PETRI_PLACES=102, PETRI_TRANSITIONS=86} [2023-11-06 22:17:05,392 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 49 predicate places. [2023-11-06 22:17:05,392 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 86 transitions, 684 flow [2023-11-06 22:17:05,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 132.0) internal successors, (924), 7 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have 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:17:05,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:05,393 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:17:05,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:17:05,394 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:05,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:05,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1082953870, now seen corresponding path program 1 times [2023-11-06 22:17:05,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:05,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722834668] [2023-11-06 22:17:05,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:05,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:05,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:05,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722834668] [2023-11-06 22:17:05,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722834668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:05,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:05,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:17:05,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74438534] [2023-11-06 22:17:05,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:05,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:17:05,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:05,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:17:05,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:17:05,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 295 [2023-11-06 22:17:05,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 86 transitions, 684 flow. Second operand has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:05,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:05,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 295 [2023-11-06 22:17:05,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:14,728 INFO L124 PetriNetUnfolderBase]: 34826/54562 cut-off events. [2023-11-06 22:17:14,728 INFO L125 PetriNetUnfolderBase]: For 206984/206984 co-relation queries the response was YES. [2023-11-06 22:17:15,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251356 conditions, 54562 events. 34826/54562 cut-off events. For 206984/206984 co-relation queries the response was YES. Maximal size of possible extension queue 2608. Compared 440834 event pairs, 4482 based on Foata normal form. 1/54563 useless extension candidates. Maximal degree in co-relation 251325. Up to 27102 conditions per place. [2023-11-06 22:17:15,180 INFO L140 encePairwiseOnDemand]: 287/295 looper letters, 156 selfloop transitions, 16 changer transitions 42/214 dead transitions. [2023-11-06 22:17:15,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 214 transitions, 2103 flow [2023-11-06 22:17:15,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:17:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:17:15,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 834 transitions. [2023-11-06 22:17:15,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4711864406779661 [2023-11-06 22:17:15,184 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 834 transitions. [2023-11-06 22:17:15,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 834 transitions. [2023-11-06 22:17:15,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:15,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 834 transitions. [2023-11-06 22:17:15,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have 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:17:15,190 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:17:15,191 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:17:15,191 INFO L175 Difference]: Start difference. First operand has 102 places, 86 transitions, 684 flow. Second operand 6 states and 834 transitions. [2023-11-06 22:17:15,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 214 transitions, 2103 flow [2023-11-06 22:17:40,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 214 transitions, 1818 flow, removed 65 selfloop flow, removed 10 redundant places. [2023-11-06 22:17:40,481 INFO L231 Difference]: Finished difference. Result has 98 places, 80 transitions, 555 flow [2023-11-06 22:17:40,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=98, PETRI_TRANSITIONS=80} [2023-11-06 22:17:40,482 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 45 predicate places. [2023-11-06 22:17:40,482 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 80 transitions, 555 flow [2023-11-06 22:17:40,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:40,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:40,483 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:17:40,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:17:40,483 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:40,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:40,483 INFO L85 PathProgramCache]: Analyzing trace with hash -309965534, now seen corresponding path program 2 times [2023-11-06 22:17:40,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:40,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644480739] [2023-11-06 22:17:40,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:40,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:41,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:41,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644480739] [2023-11-06 22:17:41,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644480739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:41,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:41,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:17:41,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904304896] [2023-11-06 22:17:41,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:41,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:17:41,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:41,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:17:41,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:17:41,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2023-11-06 22:17:41,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 80 transitions, 555 flow. Second operand has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have 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:17:41,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:17:41,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2023-11-06 22:17:41,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:17:44,550 INFO L124 PetriNetUnfolderBase]: 10303/17273 cut-off events. [2023-11-06 22:17:44,550 INFO L125 PetriNetUnfolderBase]: For 40924/42043 co-relation queries the response was YES. [2023-11-06 22:17:44,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68815 conditions, 17273 events. 10303/17273 cut-off events. For 40924/42043 co-relation queries the response was YES. Maximal size of possible extension queue 1051. Compared 135922 event pairs, 1666 based on Foata normal form. 551/17544 useless extension candidates. Maximal degree in co-relation 68785. Up to 6199 conditions per place. [2023-11-06 22:17:44,727 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 116 selfloop transitions, 13 changer transitions 0/147 dead transitions. [2023-11-06 22:17:44,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 147 transitions, 1160 flow [2023-11-06 22:17:44,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:17:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:17:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 989 transitions. [2023-11-06 22:17:44,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47893462469733655 [2023-11-06 22:17:44,732 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 989 transitions. [2023-11-06 22:17:44,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 989 transitions. [2023-11-06 22:17:44,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:17:44,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 989 transitions. [2023-11-06 22:17:44,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.28571428571428) internal successors, (989), 7 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have 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:17:44,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have 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:17:44,738 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have 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:17:44,739 INFO L175 Difference]: Start difference. First operand has 98 places, 80 transitions, 555 flow. Second operand 7 states and 989 transitions. [2023-11-06 22:17:44,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 147 transitions, 1160 flow [2023-11-06 22:17:46,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 147 transitions, 1084 flow, removed 30 selfloop flow, removed 7 redundant places. [2023-11-06 22:17:46,730 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 546 flow [2023-11-06 22:17:46,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=546, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2023-11-06 22:17:46,730 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 39 predicate places. [2023-11-06 22:17:46,731 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 546 flow [2023-11-06 22:17:46,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have 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:17:46,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:17:46,732 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:17:46,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:17:46,732 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:17:46,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:46,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1779804942, now seen corresponding path program 3 times [2023-11-06 22:17:46,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:46,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901782220] [2023-11-06 22:17:46,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:46,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:17:46,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:17:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:17:46,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:17:46,932 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:17:46,933 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:17:46,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:17:46,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:17:46,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:17:46,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:17:46,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:17:46,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:17:46,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:17:46,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:17:46,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:17:46,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:17:46,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:17:46,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:17:46,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:17:46,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:17:46,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:17:46,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:17:46,944 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:46,953 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:17:46,953 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:17:47,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:17:47 BasicIcfg [2023-11-06 22:17:47,104 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:17:47,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:17:47,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:17:47,105 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:17:47,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:52" (3/4) ... [2023-11-06 22:17:47,107 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:17:47,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:17:47,109 INFO L158 Benchmark]: Toolchain (without parser) took 116708.86ms. Allocated memory was 182.5MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 136.8MB in the beginning and 6.2GB in the end (delta: -6.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-11-06 22:17:47,109 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 115.3MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:17:47,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 880.06ms. Allocated memory is still 182.5MB. Free memory was 136.0MB in the beginning and 112.1MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:17:47,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 131.61ms. Allocated memory is still 182.5MB. Free memory was 112.1MB in the beginning and 110.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:17:47,111 INFO L158 Benchmark]: Boogie Preprocessor took 71.79ms. Allocated memory is still 182.5MB. Free memory was 110.1MB in the beginning and 108.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:17:47,111 INFO L158 Benchmark]: RCFGBuilder took 1177.45ms. Allocated memory is still 182.5MB. Free memory was 108.0MB in the beginning and 65.5MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2023-11-06 22:17:47,112 INFO L158 Benchmark]: TraceAbstraction took 114434.44ms. Allocated memory was 182.5MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 64.7MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-06 22:17:47,112 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 7.7GB. Free memory is still 6.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:17:47,114 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.37ms. Allocated memory is still 115.3MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 880.06ms. Allocated memory is still 182.5MB. Free memory was 136.0MB in the beginning and 112.1MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 131.61ms. Allocated memory is still 182.5MB. Free memory was 112.1MB in the beginning and 110.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.79ms. Allocated memory is still 182.5MB. Free memory was 110.1MB in the beginning and 108.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1177.45ms. Allocated memory is still 182.5MB. Free memory was 108.0MB in the beginning and 65.5MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 114434.44ms. Allocated memory was 182.5MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 64.7MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 7.7GB. Free memory is still 6.2GB. 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: 7.6s, 158 PlacesBefore, 53 PlacesAfterwards, 148 TransitionsBefore, 41 TransitionsAfterwards, 4064 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 143 TotalNumberOfCompositions, 11476 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5166, independent: 4916, independent conditional: 0, independent unconditional: 4916, dependent: 250, dependent conditional: 0, dependent unconditional: 250, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2144, independent: 2094, independent conditional: 0, independent unconditional: 2094, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5166, independent: 2822, independent conditional: 0, independent unconditional: 2822, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 2144, unknown conditional: 0, unknown unconditional: 2144] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 163, Positive conditional cache size: 0, Positive unconditional cache size: 163, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L868] 0 pthread_t t433; [L869] FCALL, FORK 0 pthread_create(&t433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t433, ((void *)0), P0, ((void *)0))=-3, t433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t434; [L871] FCALL, FORK 0 pthread_create(&t434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t434, ((void *)0), P1, ((void *)0))=-2, t433={5:0}, t434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t435; [L873] FCALL, FORK 0 pthread_create(&t435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t435, ((void *)0), P2, ((void *)0))=-1, t433={5:0}, t434={6:0}, t435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L874] 0 pthread_t t436; [L875] FCALL, FORK 0 pthread_create(&t436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t436, ((void *)0), P3, ((void *)0))=0, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=1] [L827] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=1] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 a$flush_delayed = weak$$choice2 [L833] 4 a$mem_tmp = a [L834] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L835] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EBX = a [L842] 4 a = a$flush_delayed ? a$mem_tmp : a [L843] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=1, x=1, y=1, z=1] [L846] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L848] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L849] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L850] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=1, x=1, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=1, x=1, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L810] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L812] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L813] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L814] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L853] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L855] 4 return 0; [L877] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L879] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L879] RET 0 assume_abort_if_not(main$tmp_guard0) [L881] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L883] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L884] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L885] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L888] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 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", "mix017.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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, x=1, 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: 866]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 871]: 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: 875]: 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: 869]: 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: 873]: 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, 188 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: 114.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 97.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1118 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 944 mSDsluCounter, 377 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 313 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3095 IncrementalHoareTripleChecker+Invalid, 3231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 64 mSDtfsCounter, 3095 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=691occurred in iteration=11, InterpolantAutomatonStates: 83, 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.7s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 2798 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:17:47,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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 a97b4f259d777d70ea3df756a2f94b2605f52fea9df0872361c6911477a44448 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:17:50,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:17:50,379 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:17:50,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:17:50,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:17:50,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:17:50,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:17:50,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:17:50,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:17:50,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:17:50,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:17:50,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:17:50,448 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:17:50,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:17:50,450 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:17:50,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:17:50,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:17:50,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:17:50,452 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:17:50,452 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:17:50,453 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:17:50,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:17:50,454 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:17:50,454 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:17:50,455 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:17:50,455 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:17:50,456 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:17:50,456 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:17:50,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:17:50,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:17:50,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:17:50,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:17:50,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:17:50,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:17:50,461 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:17:50,461 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:17:50,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:17:50,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:17:50,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:17:50,463 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:17:50,463 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:17:50,464 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_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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 -> a97b4f259d777d70ea3df756a2f94b2605f52fea9df0872361c6911477a44448 [2023-11-06 22:17:50,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:17:51,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:17:51,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:17:51,026 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:17:51,027 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:17:51,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix017.oepc.i [2023-11-06 22:17:54,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:17:54,655 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:17:54,656 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/sv-benchmarks/c/pthread-wmm/mix017.oepc.i [2023-11-06 22:17:54,694 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/data/7291fc79c/afc15a3dab1b48579baa3e9ec347c92d/FLAGa3f869ef3 [2023-11-06 22:17:54,714 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/data/7291fc79c/afc15a3dab1b48579baa3e9ec347c92d [2023-11-06 22:17:54,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:17:54,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:17:54,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:17:54,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:17:54,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:17:54,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:54" (1/1) ... [2023-11-06 22:17:54,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b3863f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:54, skipping insertion in model container [2023-11-06 22:17:54,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:54" (1/1) ... [2023-11-06 22:17:54,814 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:17:55,297 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:17:55,314 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:17:55,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:17:55,536 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:17:55,536 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:17:55,544 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:17:55,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55 WrapperNode [2023-11-06 22:17:55,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:17:55,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:17:55,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:17:55,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:17:55,557 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:17:55" (1/1) ... [2023-11-06 22:17:55,592 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:17:55" (1/1) ... [2023-11-06 22:17:55,649 INFO L138 Inliner]: procedures = 180, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 152 [2023-11-06 22:17:55,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:17:55,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:17:55,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:17:55,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:17:55,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,714 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:17:55,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:17:55,746 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:17:55,746 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:17:55,747 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:17:55,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:17:55,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:17:55,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:17:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:17:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:17:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:17:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:17:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:17:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:17:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:17:55,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:17:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:17:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:17:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:17:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:17:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:17:55,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:17:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:17:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:17:55,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:17:55,837 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:17:56,074 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:17:56,077 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:17:56,708 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:17:56,887 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:17:56,888 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:17:56,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:56 BoogieIcfgContainer [2023-11-06 22:17:56,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:17:56,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:17:56,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:17:56,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:17:56,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:17:54" (1/3) ... [2023-11-06 22:17:56,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cee771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:56, skipping insertion in model container [2023-11-06 22:17:56,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (2/3) ... [2023-11-06 22:17:56,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cee771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:56, skipping insertion in model container [2023-11-06 22:17:56,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:56" (3/3) ... [2023-11-06 22:17:56,905 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017.oepc.i [2023-11-06 22:17:56,927 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:17:56,927 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:17:56,927 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:17:57,043 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:17:57,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 153 transitions, 322 flow [2023-11-06 22:17:57,191 INFO L124 PetriNetUnfolderBase]: 3/149 cut-off events. [2023-11-06 22:17:57,192 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:17:57,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 3/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 117 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-06 22:17:57,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 153 transitions, 322 flow [2023-11-06 22:17:57,209 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 149 transitions, 310 flow [2023-11-06 22:17:57,213 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:17:57,231 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 149 transitions, 310 flow [2023-11-06 22:17:57,236 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 149 transitions, 310 flow [2023-11-06 22:17:57,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 149 transitions, 310 flow [2023-11-06 22:17:57,275 INFO L124 PetriNetUnfolderBase]: 3/149 cut-off events. [2023-11-06 22:17:57,275 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:17:57,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 3/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 116 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-06 22:17:57,281 INFO L119 LiptonReduction]: Number of co-enabled transitions 4064 [2023-11-06 22:18:08,460 INFO L134 LiptonReduction]: Checked pairs total: 11614 [2023-11-06 22:18:08,461 INFO L136 LiptonReduction]: Total number of compositions: 148 [2023-11-06 22:18:08,477 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:18:08,484 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;@3a3e1e8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:18:08,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:18:08,486 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:18:08,486 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:18:08,486 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:18:08,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:08,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:18:08,488 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:18:08,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:08,493 INFO L85 PathProgramCache]: Analyzing trace with hash 663, now seen corresponding path program 1 times [2023-11-06 22:18:08,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:08,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772356034] [2023-11-06 22:18:08,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:08,507 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:18:08,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:08,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:08,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:08,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:18:08,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:08,628 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:18:08,628 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:08,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:08,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772356034] [2023-11-06 22:18:08,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772356034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:08,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:08,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:18:08,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599424776] [2023-11-06 22:18:08,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:08,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:18:08,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:08,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:18:08,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:18:08,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 301 [2023-11-06 22:18:08,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have 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:18:08,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:08,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 301 [2023-11-06 22:18:08,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:11,301 INFO L124 PetriNetUnfolderBase]: 8719/11875 cut-off events. [2023-11-06 22:18:11,301 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-11-06 22:18:11,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23823 conditions, 11875 events. 8719/11875 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 62266 event pairs, 8719 based on Foata normal form. 0/10353 useless extension candidates. Maximal degree in co-relation 23811. Up to 11731 conditions per place. [2023-11-06 22:18:11,448 INFO L140 encePairwiseOnDemand]: 292/301 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-11-06 22:18:11,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2023-11-06 22:18:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:18:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:18:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 311 transitions. [2023-11-06 22:18:11,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166112956810631 [2023-11-06 22:18:11,470 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 311 transitions. [2023-11-06 22:18:11,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 311 transitions. [2023-11-06 22:18:11,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:11,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 311 transitions. [2023-11-06 22:18:11,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 155.5) internal successors, (311), 2 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have 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:18:11,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have 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:18:11,487 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have 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:18:11,489 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 311 transitions. [2023-11-06 22:18:11,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2023-11-06 22:18:11,508 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:18:11,510 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-11-06 22:18:11,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, 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:18:11,517 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-11-06 22:18:11,518 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-11-06 22:18:11,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have 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:18:11,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:11,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:18:11,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:11,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:11,744 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:18:11,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:11,744 INFO L85 PathProgramCache]: Analyzing trace with hash 651541, now seen corresponding path program 1 times [2023-11-06 22:18:11,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:11,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485965950] [2023-11-06 22:18:11,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:11,746 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:18:11,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:11,755 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:11,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:11,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:18:11,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:11,943 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:18:11,944 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:11,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:11,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485965950] [2023-11-06 22:18:11,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485965950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:11,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:11,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:18:11,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150089109] [2023-11-06 22:18:11,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:11,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:18:11,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:11,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:18:11,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:18:11,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 301 [2023-11-06 22:18:11,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have 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:18:11,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:11,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 301 [2023-11-06 22:18:11,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:13,716 INFO L124 PetriNetUnfolderBase]: 6855/9363 cut-off events. [2023-11-06 22:18:13,718 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:18:13,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18800 conditions, 9363 events. 6855/9363 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 46841 event pairs, 3527 based on Foata normal form. 0/8699 useless extension candidates. Maximal degree in co-relation 18797. Up to 7399 conditions per place. [2023-11-06 22:18:13,818 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-11-06 22:18:13,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2023-11-06 22:18:13,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:18:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:18:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-11-06 22:18:13,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071982281284607 [2023-11-06 22:18:13,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-11-06 22:18:13,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-11-06 22:18:13,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:13,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-11-06 22:18:13,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:13,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have 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:18:13,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have 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:18:13,846 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 458 transitions. [2023-11-06 22:18:13,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2023-11-06 22:18:13,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:18:13,848 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-11-06 22:18:13,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, 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=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-11-06 22:18:13,850 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-11-06 22:18:13,850 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-11-06 22:18:13,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have 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:18:13,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:13,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:13,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:14,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:14,063 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:18:14,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash -519261702, now seen corresponding path program 1 times [2023-11-06 22:18:14,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:14,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491801241] [2023-11-06 22:18:14,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:14,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:14,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:14,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:14,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:14,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:18:14,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:14,271 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:18:14,271 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:14,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:14,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491801241] [2023-11-06 22:18:14,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491801241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:14,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:14,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:18:14,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850263279] [2023-11-06 22:18:14,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:14,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:18:14,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:14,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:18:14,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:18:14,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 301 [2023-11-06 22:18:14,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 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:18:14,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:14,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 301 [2023-11-06 22:18:14,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:15,615 INFO L124 PetriNetUnfolderBase]: 4483/6395 cut-off events. [2023-11-06 22:18:15,616 INFO L125 PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES. [2023-11-06 22:18:15,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13344 conditions, 6395 events. 4483/6395 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 34345 event pairs, 818 based on Foata normal form. 320/6482 useless extension candidates. Maximal degree in co-relation 13340. Up to 4756 conditions per place. [2023-11-06 22:18:15,676 INFO L140 encePairwiseOnDemand]: 294/301 looper letters, 40 selfloop transitions, 5 changer transitions 27/76 dead transitions. [2023-11-06 22:18:15,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 76 transitions, 320 flow [2023-11-06 22:18:15,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:18:15,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:18:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 724 transitions. [2023-11-06 22:18:15,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48106312292358805 [2023-11-06 22:18:15,682 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 724 transitions. [2023-11-06 22:18:15,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 724 transitions. [2023-11-06 22:18:15,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:15,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 724 transitions. [2023-11-06 22:18:15,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have 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:18:15,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have 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:18:15,695 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have 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:18:15,696 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 724 transitions. [2023-11-06 22:18:15,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 76 transitions, 320 flow [2023-11-06 22:18:15,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 76 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:18:15,700 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 113 flow [2023-11-06 22:18:15,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-11-06 22:18:15,703 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2023-11-06 22:18:15,703 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 113 flow [2023-11-06 22:18:15,704 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:18:15,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:15,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:15,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:15,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:15,918 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:18:15,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:15,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1077234589, now seen corresponding path program 1 times [2023-11-06 22:18:15,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:15,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295186441] [2023-11-06 22:18:15,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:15,920 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:18:15,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:15,921 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:15,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:16,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:18:16,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:16,152 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:18:16,153 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:16,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:16,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295186441] [2023-11-06 22:18:16,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295186441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:16,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:16,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:18:16,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299476039] [2023-11-06 22:18:16,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:16,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:18:16,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:16,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:18:16,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:18:16,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 301 [2023-11-06 22:18:16,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have 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:18:16,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:16,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 301 [2023-11-06 22:18:16,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:17,183 INFO L124 PetriNetUnfolderBase]: 2161/3290 cut-off events. [2023-11-06 22:18:17,183 INFO L125 PetriNetUnfolderBase]: For 1180/1180 co-relation queries the response was YES. [2023-11-06 22:18:17,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8685 conditions, 3290 events. 2161/3290 cut-off events. For 1180/1180 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17293 event pairs, 403 based on Foata normal form. 212/3404 useless extension candidates. Maximal degree in co-relation 8678. Up to 1426 conditions per place. [2023-11-06 22:18:17,211 INFO L140 encePairwiseOnDemand]: 294/301 looper letters, 53 selfloop transitions, 9 changer transitions 27/93 dead transitions. [2023-11-06 22:18:17,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 93 transitions, 469 flow [2023-11-06 22:18:17,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:18:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:18:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 871 transitions. [2023-11-06 22:18:17,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.482281284606866 [2023-11-06 22:18:17,217 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 871 transitions. [2023-11-06 22:18:17,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 871 transitions. [2023-11-06 22:18:17,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:17,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 871 transitions. [2023-11-06 22:18:17,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 145.16666666666666) internal successors, (871), 6 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have 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:18:17,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 301.0) internal successors, (2107), 7 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have 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:18:17,230 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 301.0) internal successors, (2107), 7 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have 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:18:17,231 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 113 flow. Second operand 6 states and 871 transitions. [2023-11-06 22:18:17,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 93 transitions, 469 flow [2023-11-06 22:18:17,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 462 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:18:17,244 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 178 flow [2023-11-06 22:18:17,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-11-06 22:18:17,246 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-11-06 22:18:17,246 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 178 flow [2023-11-06 22:18:17,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have 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:18:17,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:17,248 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:18:17,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:17,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:17,463 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:18:17,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:17,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1969844603, now seen corresponding path program 1 times [2023-11-06 22:18:17,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:17,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164099672] [2023-11-06 22:18:17,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:17,466 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:18:17,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:17,468 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:17,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:17,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:18:17,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:17,728 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:18:17,728 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:17,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:17,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164099672] [2023-11-06 22:18:17,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164099672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:17,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:17,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:18:17,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553687486] [2023-11-06 22:18:17,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:17,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:18:17,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:17,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:18:17,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:18:17,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 301 [2023-11-06 22:18:17,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:17,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:17,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 301 [2023-11-06 22:18:17,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:18,573 INFO L124 PetriNetUnfolderBase]: 1189/1868 cut-off events. [2023-11-06 22:18:18,573 INFO L125 PetriNetUnfolderBase]: For 1804/1804 co-relation queries the response was YES. [2023-11-06 22:18:18,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5588 conditions, 1868 events. 1189/1868 cut-off events. For 1804/1804 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9176 event pairs, 331 based on Foata normal form. 77/1910 useless extension candidates. Maximal degree in co-relation 5579. Up to 630 conditions per place. [2023-11-06 22:18:18,593 INFO L140 encePairwiseOnDemand]: 294/301 looper letters, 64 selfloop transitions, 13 changer transitions 27/108 dead transitions. [2023-11-06 22:18:18,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 108 transitions, 638 flow [2023-11-06 22:18:18,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:18:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:18:18,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1016 transitions. [2023-11-06 22:18:18,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48220218319886093 [2023-11-06 22:18:18,600 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1016 transitions. [2023-11-06 22:18:18,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1016 transitions. [2023-11-06 22:18:18,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:18,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1016 transitions. [2023-11-06 22:18:18,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.14285714285714) internal successors, (1016), 7 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:18,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have 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:18:18,614 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have 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:18:18,614 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 178 flow. Second operand 7 states and 1016 transitions. [2023-11-06 22:18:18,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 108 transitions, 638 flow [2023-11-06 22:18:18,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 108 transitions, 576 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-11-06 22:18:18,636 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 228 flow [2023-11-06 22:18:18,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-11-06 22:18:18,639 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2023-11-06 22:18:18,640 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 228 flow [2023-11-06 22:18:18,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:18,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:18,641 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:18:18,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:18,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:18,873 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:18:18,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:18,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1039486418, now seen corresponding path program 1 times [2023-11-06 22:18:18,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:18,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560550563] [2023-11-06 22:18:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:18,878 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:18:18,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:18,879 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:18,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:19,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:18:19,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:19,156 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:18:19,157 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:19,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:19,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560550563] [2023-11-06 22:18:19,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560550563] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:19,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:19,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:18:19,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275924319] [2023-11-06 22:18:19,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:19,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:18:19,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:19,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:18:19,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:18:19,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 301 [2023-11-06 22:18:19,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 132.85714285714286) internal successors, (930), 7 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have 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:18:19,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:19,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 301 [2023-11-06 22:18:19,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:20,151 INFO L124 PetriNetUnfolderBase]: 1011/1562 cut-off events. [2023-11-06 22:18:20,152 INFO L125 PetriNetUnfolderBase]: For 1449/1449 co-relation queries the response was YES. [2023-11-06 22:18:20,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4514 conditions, 1562 events. 1011/1562 cut-off events. For 1449/1449 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7446 event pairs, 326 based on Foata normal form. 14/1554 useless extension candidates. Maximal degree in co-relation 4504. Up to 630 conditions per place. [2023-11-06 22:18:20,172 INFO L140 encePairwiseOnDemand]: 294/301 looper letters, 60 selfloop transitions, 17 changer transitions 14/95 dead transitions. [2023-11-06 22:18:20,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 95 transitions, 574 flow [2023-11-06 22:18:20,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:18:20,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:18:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1133 transitions. [2023-11-06 22:18:20,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47051495016611294 [2023-11-06 22:18:20,180 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1133 transitions. [2023-11-06 22:18:20,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1133 transitions. [2023-11-06 22:18:20,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:20,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1133 transitions. [2023-11-06 22:18:20,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 141.625) internal successors, (1133), 8 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have 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:18:20,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 301.0) internal successors, (2709), 9 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have 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:18:20,198 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 301.0) internal successors, (2709), 9 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have 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:18:20,198 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 228 flow. Second operand 8 states and 1133 transitions. [2023-11-06 22:18:20,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 95 transitions, 574 flow [2023-11-06 22:18:20,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 95 transitions, 512 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-11-06 22:18:20,226 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 222 flow [2023-11-06 22:18:20,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-11-06 22:18:20,230 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2023-11-06 22:18:20,231 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 222 flow [2023-11-06 22:18:20,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 132.85714285714286) internal successors, (930), 7 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have 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:18:20,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:20,233 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:18:20,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:20,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:20,454 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:18:20,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:20,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1231155002, now seen corresponding path program 1 times [2023-11-06 22:18:20,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:20,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486030653] [2023-11-06 22:18:20,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:18:20,455 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:18:20,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:20,457 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:20,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:18:20,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:18:20,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:21,459 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:18:21,459 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:21,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:21,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486030653] [2023-11-06 22:18:21,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486030653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:21,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:21,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:18:21,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861231107] [2023-11-06 22:18:21,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:21,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:18:21,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:21,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:18:21,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:18:21,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 301 [2023-11-06 22:18:21,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have 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:18:21,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:21,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 301 [2023-11-06 22:18:21,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:22,326 INFO L124 PetriNetUnfolderBase]: 1159/1892 cut-off events. [2023-11-06 22:18:22,326 INFO L125 PetriNetUnfolderBase]: For 2146/2146 co-relation queries the response was YES. [2023-11-06 22:18:22,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5432 conditions, 1892 events. 1159/1892 cut-off events. For 2146/2146 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10153 event pairs, 145 based on Foata normal form. 0/1884 useless extension candidates. Maximal degree in co-relation 5421. Up to 773 conditions per place. [2023-11-06 22:18:22,345 INFO L140 encePairwiseOnDemand]: 295/301 looper letters, 101 selfloop transitions, 6 changer transitions 0/111 dead transitions. [2023-11-06 22:18:22,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 111 transitions, 814 flow [2023-11-06 22:18:22,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:18:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:18:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 989 transitions. [2023-11-06 22:18:22,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2023-11-06 22:18:22,354 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 989 transitions. [2023-11-06 22:18:22,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 989 transitions. [2023-11-06 22:18:22,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:22,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 989 transitions. [2023-11-06 22:18:22,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.28571428571428) internal successors, (989), 7 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have 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:18:22,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have 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:18:22,365 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have 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:18:22,365 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 222 flow. Second operand 7 states and 989 transitions. [2023-11-06 22:18:22,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 111 transitions, 814 flow [2023-11-06 22:18:22,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 111 transitions, 658 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-11-06 22:18:22,382 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 182 flow [2023-11-06 22:18:22,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2023-11-06 22:18:22,383 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2023-11-06 22:18:22,383 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 182 flow [2023-11-06 22:18:22,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have 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:18:22,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:22,384 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:18:22,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:22,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:22,598 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:18:22,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:22,598 INFO L85 PathProgramCache]: Analyzing trace with hash -231987288, now seen corresponding path program 2 times [2023-11-06 22:18:22,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:22,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034825304] [2023-11-06 22:18:22,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:18:22,599 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:18:22,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:22,601 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:22,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:22,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:18:22,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:18:22,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:18:22,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:22,859 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:18:22,859 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:22,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:22,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034825304] [2023-11-06 22:18:22,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034825304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:22,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:22,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:18:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98197132] [2023-11-06 22:18:22,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:22,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:18:22,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:22,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:18:22,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:18:22,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 301 [2023-11-06 22:18:22,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have 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:18:22,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:22,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 301 [2023-11-06 22:18:22,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:23,468 INFO L124 PetriNetUnfolderBase]: 2066/3324 cut-off events. [2023-11-06 22:18:23,468 INFO L125 PetriNetUnfolderBase]: For 2584/2584 co-relation queries the response was YES. [2023-11-06 22:18:23,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9285 conditions, 3324 events. 2066/3324 cut-off events. For 2584/2584 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 19317 event pairs, 239 based on Foata normal form. 1/3316 useless extension candidates. Maximal degree in co-relation 9275. Up to 1644 conditions per place. [2023-11-06 22:18:23,502 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 94 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2023-11-06 22:18:23,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 99 transitions, 616 flow [2023-11-06 22:18:23,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:18:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:18:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 594 transitions. [2023-11-06 22:18:23,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49335548172757476 [2023-11-06 22:18:23,506 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 594 transitions. [2023-11-06 22:18:23,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 594 transitions. [2023-11-06 22:18:23,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:23,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 594 transitions. [2023-11-06 22:18:23,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have 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:18:23,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have 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:18:23,514 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have 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:18:23,514 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 182 flow. Second operand 4 states and 594 transitions. [2023-11-06 22:18:23,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 99 transitions, 616 flow [2023-11-06 22:18:23,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 99 transitions, 605 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:18:23,558 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 189 flow [2023-11-06 22:18:23,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2023-11-06 22:18:23,559 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2023-11-06 22:18:23,559 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 189 flow [2023-11-06 22:18:23,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have 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:18:23,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:23,560 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:18:23,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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)] Ended with exit code 0 [2023-11-06 22:18:23,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:23,785 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:18:23,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:23,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1580631208, now seen corresponding path program 3 times [2023-11-06 22:18:23,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:23,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581478838] [2023-11-06 22:18:23,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:18:23,787 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:18:23,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:23,789 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:23,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:23,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:18:23,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:18:23,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:18:23,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:24,056 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:18:24,056 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:24,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:24,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581478838] [2023-11-06 22:18:24,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581478838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:24,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:24,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:18:24,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688446067] [2023-11-06 22:18:24,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:24,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:18:24,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:24,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:18:24,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:18:24,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 301 [2023-11-06 22:18:24,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have 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:18:24,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:24,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 301 [2023-11-06 22:18:24,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:25,145 INFO L124 PetriNetUnfolderBase]: 3389/5406 cut-off events. [2023-11-06 22:18:25,146 INFO L125 PetriNetUnfolderBase]: For 4563/4563 co-relation queries the response was YES. [2023-11-06 22:18:25,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15437 conditions, 5406 events. 3389/5406 cut-off events. For 4563/4563 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 32922 event pairs, 524 based on Foata normal form. 1/5374 useless extension candidates. Maximal degree in co-relation 15425. Up to 2588 conditions per place. [2023-11-06 22:18:25,201 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 90 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2023-11-06 22:18:25,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 96 transitions, 601 flow [2023-11-06 22:18:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:18:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:18:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 590 transitions. [2023-11-06 22:18:25,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4900332225913621 [2023-11-06 22:18:25,206 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 590 transitions. [2023-11-06 22:18:25,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 590 transitions. [2023-11-06 22:18:25,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:25,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 590 transitions. [2023-11-06 22:18:25,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.5) internal successors, (590), 4 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have 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:18:25,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have 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:18:25,214 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have 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:18:25,215 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 189 flow. Second operand 4 states and 590 transitions. [2023-11-06 22:18:25,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 96 transitions, 601 flow [2023-11-06 22:18:25,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 96 transitions, 599 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:18:25,299 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 201 flow [2023-11-06 22:18:25,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2023-11-06 22:18:25,300 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2023-11-06 22:18:25,301 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 201 flow [2023-11-06 22:18:25,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have 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:18:25,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:25,302 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:18:25,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:25,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:25,512 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:18:25,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:25,512 INFO L85 PathProgramCache]: Analyzing trace with hash 448669222, now seen corresponding path program 4 times [2023-11-06 22:18:25,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:25,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613113614] [2023-11-06 22:18:25,513 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:18:25,513 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:18:25,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:25,518 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:25,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:25,707 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:18:25,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:18:25,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:18:25,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:25,764 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:18:25,764 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:18:25,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:25,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613113614] [2023-11-06 22:18:25,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613113614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:18:25,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:18:25,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:18:25,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565214055] [2023-11-06 22:18:25,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:18:25,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:18:25,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:25,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:18:25,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:18:25,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 301 [2023-11-06 22:18:25,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have 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:18:25,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:18:25,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 301 [2023-11-06 22:18:25,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:18:27,117 INFO L124 PetriNetUnfolderBase]: 5141/8090 cut-off events. [2023-11-06 22:18:27,118 INFO L125 PetriNetUnfolderBase]: For 7669/7669 co-relation queries the response was YES. [2023-11-06 22:18:27,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23964 conditions, 8090 events. 5141/8090 cut-off events. For 7669/7669 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 51872 event pairs, 1335 based on Foata normal form. 1/7960 useless extension candidates. Maximal degree in co-relation 23950. Up to 3438 conditions per place. [2023-11-06 22:18:27,170 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 84 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-11-06 22:18:27,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 584 flow [2023-11-06 22:18:27,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:18:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:18:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 585 transitions. [2023-11-06 22:18:27,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48588039867109634 [2023-11-06 22:18:27,174 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 585 transitions. [2023-11-06 22:18:27,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 585 transitions. [2023-11-06 22:18:27,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:18:27,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 585 transitions. [2023-11-06 22:18:27,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have 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:18:27,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have 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:18:27,182 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have 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:18:27,182 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 201 flow. Second operand 4 states and 585 transitions. [2023-11-06 22:18:27,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 584 flow [2023-11-06 22:18:27,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 91 transitions, 582 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:18:27,348 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 213 flow [2023-11-06 22:18:27,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2023-11-06 22:18:27,349 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2023-11-06 22:18:27,349 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 213 flow [2023-11-06 22:18:27,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have 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:18:27,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:18:27,350 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:18:27,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:27,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:27,551 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:18:27,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:27,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2004292362, now seen corresponding path program 5 times [2023-11-06 22:18:27,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:27,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488388755] [2023-11-06 22:18:27,552 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:18:27,552 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:18:27,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:27,553 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:27,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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 (12)] Waiting until timeout for monitored process [2023-11-06 22:18:27,806 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:18:27,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:18:27,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:18:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:18:28,061 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:18:28,061 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:18:28,063 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:18:28,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:18:28,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:18:28,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:18:28,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:18:28,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:18:28,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:18:28,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:18:28,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:18:28,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:18:28,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:18:28,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:18:28,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:18:28,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:18:28,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:18:28,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:18:28,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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 (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:18:28,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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:18:28,284 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:28,290 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:18:28,290 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:18:28,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:18:28 BasicIcfg [2023-11-06 22:18:28,416 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:18:28,417 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:18:28,417 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:18:28,417 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:18:28,418 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:56" (3/4) ... [2023-11-06 22:18:28,420 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:18:28,421 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:18:28,422 INFO L158 Benchmark]: Toolchain (without parser) took 33699.61ms. Allocated memory was 77.6MB in the beginning and 1.8GB in the end (delta: 1.8GB). Free memory was 52.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 440.1MB. Max. memory is 16.1GB. [2023-11-06 22:18:28,422 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 77.6MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:18:28,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 819.45ms. Allocated memory was 77.6MB in the beginning and 102.8MB in the end (delta: 25.2MB). Free memory was 52.2MB in the beginning and 75.7MB in the end (delta: -23.5MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2023-11-06 22:18:28,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.59ms. Allocated memory is still 102.8MB. Free memory was 75.7MB in the beginning and 73.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:18:28,424 INFO L158 Benchmark]: Boogie Preprocessor took 87.08ms. Allocated memory is still 102.8MB. Free memory was 73.2MB in the beginning and 70.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:18:28,424 INFO L158 Benchmark]: RCFGBuilder took 1154.01ms. Allocated memory is still 102.8MB. Free memory was 70.7MB in the beginning and 52.2MB in the end (delta: 18.4MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2023-11-06 22:18:28,425 INFO L158 Benchmark]: TraceAbstraction took 31521.81ms. Allocated memory was 102.8MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 51.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 410.2MB. Max. memory is 16.1GB. [2023-11-06 22:18:28,425 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:18:28,427 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 77.6MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 819.45ms. Allocated memory was 77.6MB in the beginning and 102.8MB in the end (delta: 25.2MB). Free memory was 52.2MB in the beginning and 75.7MB in the end (delta: -23.5MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.59ms. Allocated memory is still 102.8MB. Free memory was 75.7MB in the beginning and 73.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.08ms. Allocated memory is still 102.8MB. Free memory was 73.2MB in the beginning and 70.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1154.01ms. Allocated memory is still 102.8MB. Free memory was 70.7MB in the beginning and 52.2MB in the end (delta: 18.4MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * TraceAbstraction took 31521.81ms. Allocated memory was 102.8MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 51.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 410.2MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.2s, 159 PlacesBefore, 53 PlacesAfterwards, 149 TransitionsBefore, 41 TransitionsAfterwards, 4064 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 148 TotalNumberOfCompositions, 11614 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5247, independent: 4995, independent conditional: 0, independent unconditional: 4995, dependent: 252, dependent conditional: 0, dependent unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2160, independent: 2107, independent conditional: 0, independent unconditional: 2107, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5247, independent: 2888, independent conditional: 0, independent unconditional: 2888, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 2160, unknown conditional: 0, unknown unconditional: 2160] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 169, Positive conditional cache size: 0, Positive unconditional cache size: 169, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L868] 0 pthread_t t433; [L869] FCALL, FORK 0 pthread_create(&t433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t433, ((void *)0), P0, ((void *)0))=0, t433={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t434; [L871] FCALL, FORK 0 pthread_create(&t434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t434, ((void *)0), P1, ((void *)0))=1, t433={11:0}, t434={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L872] 0 pthread_t t435; [L873] FCALL, FORK 0 pthread_create(&t435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t435, ((void *)0), P2, ((void *)0))=2, t433={11:0}, t434={15:0}, t435={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L874] 0 pthread_t t436; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L875] FCALL, FORK 0 pthread_create(&t436, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, pthread_create(&t436, ((void *)0), P3, ((void *)0))=3, t433={11:0}, t434={15:0}, t435={7:0}, t436={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L810] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L812] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L813] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L814] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L824] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=1] [L827] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=1] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 a$flush_delayed = weak$$choice2 [L833] 4 a$mem_tmp = a [L834] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L835] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EBX = a [L842] 4 a = a$flush_delayed ? a$mem_tmp : a [L843] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=0, x=1, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=1, z=1] [L846] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L848] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L849] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L850] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L853] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L855] 4 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L877] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L879] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L879] RET 0 assume_abort_if_not(main$tmp_guard0) [L881] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L883] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L884] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L885] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t433={11:0}, t434={15:0}, t435={7:0}, t436={-2147483637:0}, weak$$choice2=0, x=1, y=1, z=1] [L888] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 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", "mix017.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={6:8}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, 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: 866]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 871]: 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: 875]: 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: 869]: 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: 873]: 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, 189 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: 31.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 494 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 422 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1923 IncrementalHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 32 mSDtfsCounter, 1923 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=5, InterpolantAutomatonStates: 50, 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.8s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 772 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1494 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:18:28,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73cd43be-04cc-4f7a-89b3-96d41cf32acc/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