./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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_d637f30e-3ea7-4f31-ae49-854970abbd64/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 28f58acc3eb15266c6a84eca373e682a200492b696916dc340e2c03025141f5c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:47:44,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:47:44,451 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:47:44,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:47:44,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:47:44,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:47:44,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:47:44,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:47:44,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:47:44,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:47:44,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:47:44,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:47:44,516 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:47:44,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:47:44,518 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:47:44,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:47:44,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:47:44,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:47:44,520 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:47:44,520 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:47:44,521 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:47:44,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:47:44,522 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:47:44,522 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:47:44,523 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:47:44,523 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:47:44,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:47:44,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:47:44,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:47:44,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:44,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:47:44,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:47:44,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:47:44,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:47:44,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:47:44,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:47:44,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:47:44,529 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:47:44,530 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_d637f30e-3ea7-4f31-ae49-854970abbd64/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_d637f30e-3ea7-4f31-ae49-854970abbd64/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 -> 28f58acc3eb15266c6a84eca373e682a200492b696916dc340e2c03025141f5c [2023-11-06 22:47:44,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:47:44,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:47:44,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:47:44,904 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:47:44,905 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:47:44,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2023-11-06 22:47:47,970 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:47:48,271 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:47:48,271 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2023-11-06 22:47:48,297 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/data/4241fb84d/3680cfdb15234d0f807dc94b9bd5cb78/FLAG1b620e8e3 [2023-11-06 22:47:48,313 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/data/4241fb84d/3680cfdb15234d0f807dc94b9bd5cb78 [2023-11-06 22:47:48,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:47:48,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:47:48,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:47:48,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:47:48,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:47:48,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:48" (1/1) ... [2023-11-06 22:47:48,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a6758a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:48, skipping insertion in model container [2023-11-06 22:47:48,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:48" (1/1) ... [2023-11-06 22:47:48,431 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:47:48,808 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:47:48,827 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:47:48,925 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:47:48,979 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:47:48,979 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:47:48,987 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:47:48,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:48 WrapperNode [2023-11-06 22:47:48,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:47:48,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:47:48,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:47:48,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:47:48,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:48" (1/1) ... [2023-11-06 22:47:49,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:48" (1/1) ... [2023-11-06 22:47:49,046 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-06 22:47:49,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:47:49,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:47:49,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:47:49,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:47:49,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:48" (1/1) ... [2023-11-06 22:47:49,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:48" (1/1) ... [2023-11-06 22:47:49,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:48" (1/1) ... [2023-11-06 22:47:49,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:48" (1/1) ... [2023-11-06 22:47:49,072 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:48" (1/1) ... [2023-11-06 22:47:49,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:48" (1/1) ... [2023-11-06 22:47:49,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:48" (1/1) ... [2023-11-06 22:47:49,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:48" (1/1) ... [2023-11-06 22:47:49,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:47:49,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:47:49,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:47:49,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:47:49,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:48" (1/1) ... [2023-11-06 22:47:49,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:49,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:47:49,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:47:49,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:47:49,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:47:49,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:47:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:47:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:47:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:47:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:47:49,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:47:49,215 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:47:49,215 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:47:49,215 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:47:49,215 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:47:49,215 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:47:49,216 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:47:49,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:47:49,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:47:49,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:47:49,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:47:49,219 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:47:49,462 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:47:49,465 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:47:49,817 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:47:49,997 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:47:49,998 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:47:50,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:50 BoogieIcfgContainer [2023-11-06 22:47:50,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:47:50,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:47:50,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:47:50,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:47:50,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:47:48" (1/3) ... [2023-11-06 22:47:50,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8bb9b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:50, skipping insertion in model container [2023-11-06 22:47:50,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:48" (2/3) ... [2023-11-06 22:47:50,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8bb9b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:50, skipping insertion in model container [2023-11-06 22:47:50,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:50" (3/3) ... [2023-11-06 22:47:50,012 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.opt_pso.opt_rmo.opt.i [2023-11-06 22:47:50,032 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:47:50,032 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:47:50,033 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:47:50,107 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:47:50,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 22:47:50,217 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 22:47:50,218 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:47:50,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 121 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-06 22:47:50,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 22:47:50,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 146 transitions, 304 flow [2023-11-06 22:47:50,243 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:47:50,256 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-06 22:47:50,260 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-06 22:47:50,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 304 flow [2023-11-06 22:47:50,309 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 22:47:50,309 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:47:50,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 121 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-06 22:47:50,315 INFO L119 LiptonReduction]: Number of co-enabled transitions 3842 [2023-11-06 22:47:57,065 INFO L134 LiptonReduction]: Checked pairs total: 10810 [2023-11-06 22:47:57,065 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-11-06 22:47:57,081 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:47:57,088 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;@60bdd322, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:47:57,088 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:47:57,089 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:47:57,090 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:47:57,090 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:47:57,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:57,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:47:57,091 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:57,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:57,096 INFO L85 PathProgramCache]: Analyzing trace with hash 632, now seen corresponding path program 1 times [2023-11-06 22:47:57,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:57,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353652114] [2023-11-06 22:47:57,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:57,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:57,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:57,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353652114] [2023-11-06 22:47:57,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353652114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:57,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:57,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:47:57,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912077226] [2023-11-06 22:47:57,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:57,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:47:57,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:57,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:47:57,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:47:57,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 289 [2023-11-06 22:47:57,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 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:47:57,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:57,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 289 [2023-11-06 22:47:57,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:58,535 INFO L124 PetriNetUnfolderBase]: 5049/6989 cut-off events. [2023-11-06 22:47:58,535 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-06 22:47:58,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14027 conditions, 6989 events. 5049/6989 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 36638 event pairs, 5049 based on Foata normal form. 0/6013 useless extension candidates. Maximal degree in co-relation 14015. Up to 6881 conditions per place. [2023-11-06 22:47:58,605 INFO L140 encePairwiseOnDemand]: 280/289 looper letters, 26 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-11-06 22:47:58,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 126 flow [2023-11-06 22:47:58,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:47:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:47:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2023-11-06 22:47:58,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311418685121108 [2023-11-06 22:47:58,619 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2023-11-06 22:47:58,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2023-11-06 22:47:58,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:58,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2023-11-06 22:47:58,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:58,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 289.0) internal successors, (867), 3 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:58,634 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 289.0) internal successors, (867), 3 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:58,636 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 307 transitions. [2023-11-06 22:47:58,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 126 flow [2023-11-06 22:47:58,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:47:58,648 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-11-06 22:47:58,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-11-06 22:47:58,654 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-11-06 22:47:58,654 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-11-06 22:47:58,655 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:47:58,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:58,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:58,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:47:58,656 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:47:58,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1552329112, now seen corresponding path program 1 times [2023-11-06 22:47:58,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:58,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312185787] [2023-11-06 22:47:58,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:58,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:59,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:59,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312185787] [2023-11-06 22:47:59,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312185787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:59,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:59,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:47:59,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369674716] [2023-11-06 22:47:59,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:59,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:59,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:59,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:59,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:59,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 289 [2023-11-06 22:47:59,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:59,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:59,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 289 [2023-11-06 22:47:59,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:00,219 INFO L124 PetriNetUnfolderBase]: 3975/5666 cut-off events. [2023-11-06 22:48:00,220 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:48:00,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11243 conditions, 5666 events. 3975/5666 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 30558 event pairs, 1089 based on Foata normal form. 0/5242 useless extension candidates. Maximal degree in co-relation 11240. Up to 4303 conditions per place. [2023-11-06 22:48:00,273 INFO L140 encePairwiseOnDemand]: 286/289 looper letters, 37 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2023-11-06 22:48:00,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 184 flow [2023-11-06 22:48:00,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2023-11-06 22:48:00,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155709342560554 [2023-11-06 22:48:00,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2023-11-06 22:48:00,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2023-11-06 22:48:00,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:00,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2023-11-06 22:48:00,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:00,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have 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:48:00,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have 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:48:00,297 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 447 transitions. [2023-11-06 22:48:00,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 184 flow [2023-11-06 22:48:00,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:48:00,299 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-11-06 22:48:00,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-06 22:48:00,301 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-11-06 22:48:00,301 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-11-06 22:48:00,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have 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:48:00,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:00,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:00,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:48:00,308 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:00,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:00,309 INFO L85 PathProgramCache]: Analyzing trace with hash 58678277, now seen corresponding path program 1 times [2023-11-06 22:48:00,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:00,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475606608] [2023-11-06 22:48:00,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:00,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:00,687 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:48:00,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:00,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475606608] [2023-11-06 22:48:00,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475606608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:00,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:00,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:48:00,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648842056] [2023-11-06 22:48:00,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:00,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:00,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:00,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:00,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:00,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 289 [2023-11-06 22:48:00,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have 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:48:00,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:00,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 289 [2023-11-06 22:48:00,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:01,548 INFO L124 PetriNetUnfolderBase]: 3975/5699 cut-off events. [2023-11-06 22:48:01,549 INFO L125 PetriNetUnfolderBase]: For 351/351 co-relation queries the response was YES. [2023-11-06 22:48:01,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11638 conditions, 5699 events. 3975/5699 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 30378 event pairs, 1527 based on Foata normal form. 0/5539 useless extension candidates. Maximal degree in co-relation 11634. Up to 3409 conditions per place. [2023-11-06 22:48:01,600 INFO L140 encePairwiseOnDemand]: 286/289 looper letters, 35 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-06 22:48:01,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 170 flow [2023-11-06 22:48:01,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-11-06 22:48:01,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074971164936563 [2023-11-06 22:48:01,603 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-11-06 22:48:01,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-11-06 22:48:01,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:01,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-11-06 22:48:01,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:01,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have 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:48:01,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have 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:48:01,610 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 440 transitions. [2023-11-06 22:48:01,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 170 flow [2023-11-06 22:48:01,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:01,614 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 74 flow [2023-11-06 22:48:01,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-06 22:48:01,616 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-11-06 22:48:01,616 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 74 flow [2023-11-06 22:48:01,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have 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:48:01,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:01,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:01,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:48:01,621 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:01,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:01,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1819027197, now seen corresponding path program 1 times [2023-11-06 22:48:01,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:01,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492301120] [2023-11-06 22:48:01,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:02,441 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:48:02,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:02,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492301120] [2023-11-06 22:48:02,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492301120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:02,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:02,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:48:02,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564077859] [2023-11-06 22:48:02,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:02,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:48:02,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:02,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:48:02,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:48:02,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 289 [2023-11-06 22:48:02,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 74 flow. Second operand has 7 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have 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:48:02,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:02,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 289 [2023-11-06 22:48:02,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:03,534 INFO L124 PetriNetUnfolderBase]: 2703/3851 cut-off events. [2023-11-06 22:48:03,534 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-06 22:48:03,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7967 conditions, 3851 events. 2703/3851 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 19475 event pairs, 408 based on Foata normal form. 192/3947 useless extension candidates. Maximal degree in co-relation 7962. Up to 2816 conditions per place. [2023-11-06 22:48:03,558 INFO L140 encePairwiseOnDemand]: 283/289 looper letters, 33 selfloop transitions, 4 changer transitions 12/54 dead transitions. [2023-11-06 22:48:03,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 222 flow [2023-11-06 22:48:03,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:48:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 862 transitions. [2023-11-06 22:48:03,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42609985170538806 [2023-11-06 22:48:03,563 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 862 transitions. [2023-11-06 22:48:03,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 862 transitions. [2023-11-06 22:48:03,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:03,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 862 transitions. [2023-11-06 22:48:03,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have 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:48:03,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have 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:48:03,574 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have 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:48:03,574 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 74 flow. Second operand 7 states and 862 transitions. [2023-11-06 22:48:03,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 222 flow [2023-11-06 22:48:03,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:03,578 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 74 flow [2023-11-06 22:48:03,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2023-11-06 22:48:03,579 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2023-11-06 22:48:03,579 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 74 flow [2023-11-06 22:48:03,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have 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:48:03,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:03,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:03,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:48:03,581 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:03,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:03,581 INFO L85 PathProgramCache]: Analyzing trace with hash 495526177, now seen corresponding path program 1 times [2023-11-06 22:48:03,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:03,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033918108] [2023-11-06 22:48:03,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:03,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,816 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:48:03,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:03,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033918108] [2023-11-06 22:48:03,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033918108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:03,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:03,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:48:03,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22236705] [2023-11-06 22:48:03,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:03,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:03,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:03,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:03,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:03,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 289 [2023-11-06 22:48:03,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have 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:48:03,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:03,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 289 [2023-11-06 22:48:03,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:05,551 INFO L124 PetriNetUnfolderBase]: 9203/12656 cut-off events. [2023-11-06 22:48:05,552 INFO L125 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2023-11-06 22:48:05,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26538 conditions, 12656 events. 9203/12656 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 64126 event pairs, 2187 based on Foata normal form. 352/13008 useless extension candidates. Maximal degree in co-relation 26533. Up to 6033 conditions per place. [2023-11-06 22:48:05,631 INFO L140 encePairwiseOnDemand]: 280/289 looper letters, 57 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2023-11-06 22:48:05,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 298 flow [2023-11-06 22:48:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2023-11-06 22:48:05,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835640138408305 [2023-11-06 22:48:05,635 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2023-11-06 22:48:05,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2023-11-06 22:48:05,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:05,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2023-11-06 22:48:05,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have 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:48:05,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have 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:48:05,642 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have 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:48:05,643 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 74 flow. Second operand 4 states and 559 transitions. [2023-11-06 22:48:05,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 298 flow [2023-11-06 22:48:05,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 65 transitions, 285 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:48:05,647 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 128 flow [2023-11-06 22:48:05,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-11-06 22:48:05,650 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2023-11-06 22:48:05,651 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 128 flow [2023-11-06 22:48:05,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have 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:48:05,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:05,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:05,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:48:05,652 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:05,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:05,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1810380953, now seen corresponding path program 1 times [2023-11-06 22:48:05,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:05,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833116721] [2023-11-06 22:48:05,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:05,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:05,863 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:48:05,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:05,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833116721] [2023-11-06 22:48:05,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833116721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:05,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:05,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:05,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379834651] [2023-11-06 22:48:05,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:05,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:05,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:05,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:05,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:05,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 289 [2023-11-06 22:48:05,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have 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:48:05,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:05,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 289 [2023-11-06 22:48:05,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:07,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L756-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0][33], [P1Thread1of1ForFork3InUse, 193#true, 47#L787true, 50#P2EXITtrue, 87#L835true, 81#L2true, Black: 172#(<= ~__unbuffered_p3_EAX~0 0), 115#P0EXITtrue, 180#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 185#true, 163#true, Black: 187#(= ~__unbuffered_p1_EAX~0 0), P3Thread1of1ForFork0InUse]) [2023-11-06 22:48:07,004 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 22:48:07,004 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:07,005 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:07,005 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:07,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L756-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0][71], [P1Thread1of1ForFork3InUse, 47#L787true, 50#P2EXITtrue, 87#L835true, 81#L2true, Black: 172#(<= ~__unbuffered_p3_EAX~0 0), 115#P0EXITtrue, 180#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 185#true, 163#true, Black: 187#(= ~__unbuffered_p1_EAX~0 0), P3Thread1of1ForFork0InUse]) [2023-11-06 22:48:07,005 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 22:48:07,005 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:07,006 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:07,006 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:07,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L756-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0][33], [P1Thread1of1ForFork3InUse, 193#true, 50#P2EXITtrue, 87#L835true, Black: 172#(<= ~__unbuffered_p3_EAX~0 0), 81#L2true, 115#P0EXITtrue, 180#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), 123#P1EXITtrue, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 163#true, Black: 185#true, 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 187#(= ~__unbuffered_p1_EAX~0 0), P3Thread1of1ForFork0InUse]) [2023-11-06 22:48:07,036 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 22:48:07,037 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:07,037 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:07,037 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:07,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L756-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0][33], [P1Thread1of1ForFork3InUse, 193#true, 16#L877true, 47#L787true, 50#P2EXITtrue, 87#L835true, Black: 172#(<= ~__unbuffered_p3_EAX~0 0), 115#P0EXITtrue, 180#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 163#true, Black: 185#true, 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 187#(= ~__unbuffered_p1_EAX~0 0), P3Thread1of1ForFork0InUse]) [2023-11-06 22:48:07,039 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 22:48:07,040 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:07,040 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:07,040 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:07,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L756-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0][71], [P1Thread1of1ForFork3InUse, 50#P2EXITtrue, 87#L835true, 81#L2true, Black: 172#(<= ~__unbuffered_p3_EAX~0 0), 115#P0EXITtrue, 180#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), 123#P1EXITtrue, P2Thread1of1ForFork2InUse, 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork1InUse, 163#true, Black: 185#true, 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 187#(= ~__unbuffered_p1_EAX~0 0), P3Thread1of1ForFork0InUse]) [2023-11-06 22:48:07,072 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 22:48:07,072 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:07,073 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:07,073 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:07,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L756-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0][33], [P1Thread1of1ForFork3InUse, 193#true, 16#L877true, 50#P2EXITtrue, 87#L835true, Black: 172#(<= ~__unbuffered_p3_EAX~0 0), 115#P0EXITtrue, 180#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), 123#P1EXITtrue, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 163#true, Black: 185#true, 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 187#(= ~__unbuffered_p1_EAX~0 0), P3Thread1of1ForFork0InUse]) [2023-11-06 22:48:07,114 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:07,114 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:07,114 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:07,115 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:07,180 INFO L124 PetriNetUnfolderBase]: 5395/7875 cut-off events. [2023-11-06 22:48:07,180 INFO L125 PetriNetUnfolderBase]: For 3502/3850 co-relation queries the response was YES. [2023-11-06 22:48:07,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19209 conditions, 7875 events. 5395/7875 cut-off events. For 3502/3850 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 47040 event pairs, 925 based on Foata normal form. 530/7757 useless extension candidates. Maximal degree in co-relation 19202. Up to 5192 conditions per place. [2023-11-06 22:48:07,242 INFO L140 encePairwiseOnDemand]: 282/289 looper letters, 60 selfloop transitions, 10 changer transitions 0/79 dead transitions. [2023-11-06 22:48:07,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 79 transitions, 403 flow [2023-11-06 22:48:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:48:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:48:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 709 transitions. [2023-11-06 22:48:07,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4906574394463668 [2023-11-06 22:48:07,246 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 709 transitions. [2023-11-06 22:48:07,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 709 transitions. [2023-11-06 22:48:07,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:07,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 709 transitions. [2023-11-06 22:48:07,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have 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:48:07,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have 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:48:07,254 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have 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:48:07,254 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 128 flow. Second operand 5 states and 709 transitions. [2023-11-06 22:48:07,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 79 transitions, 403 flow [2023-11-06 22:48:07,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 79 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:07,258 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 201 flow [2023-11-06 22:48:07,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=201, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-06 22:48:07,259 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-11-06 22:48:07,259 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 201 flow [2023-11-06 22:48:07,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have 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:48:07,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:07,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:07,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:48:07,260 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:07,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:07,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1303408263, now seen corresponding path program 1 times [2023-11-06 22:48:07,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:07,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026611] [2023-11-06 22:48:07,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:07,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:07,447 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:48:07,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:07,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026611] [2023-11-06 22:48:07,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:07,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:07,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:07,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461751755] [2023-11-06 22:48:07,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:07,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:07,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:07,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:07,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:07,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 289 [2023-11-06 22:48:07,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have 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:48:07,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:07,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 289 [2023-11-06 22:48:07,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:10,142 INFO L124 PetriNetUnfolderBase]: 12250/17607 cut-off events. [2023-11-06 22:48:10,142 INFO L125 PetriNetUnfolderBase]: For 17680/17680 co-relation queries the response was YES. [2023-11-06 22:48:10,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59009 conditions, 17607 events. 12250/17607 cut-off events. For 17680/17680 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 102569 event pairs, 2813 based on Foata normal form. 96/17703 useless extension candidates. Maximal degree in co-relation 58998. Up to 7624 conditions per place. [2023-11-06 22:48:10,247 INFO L140 encePairwiseOnDemand]: 279/289 looper letters, 73 selfloop transitions, 16 changer transitions 19/108 dead transitions. [2023-11-06 22:48:10,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 108 transitions, 718 flow [2023-11-06 22:48:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:10,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 564 transitions. [2023-11-06 22:48:10,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48788927335640137 [2023-11-06 22:48:10,250 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 564 transitions. [2023-11-06 22:48:10,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 564 transitions. [2023-11-06 22:48:10,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:10,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 564 transitions. [2023-11-06 22:48:10,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have 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:48:10,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have 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:48:10,257 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have 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:48:10,257 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 201 flow. Second operand 4 states and 564 transitions. [2023-11-06 22:48:10,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 108 transitions, 718 flow [2023-11-06 22:48:10,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 108 transitions, 705 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:10,533 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 298 flow [2023-11-06 22:48:10,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-11-06 22:48:10,534 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-11-06 22:48:10,535 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 298 flow [2023-11-06 22:48:10,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have 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:48:10,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:10,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:10,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:48:10,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:10,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:10,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1175354460, now seen corresponding path program 1 times [2023-11-06 22:48:10,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:10,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711632317] [2023-11-06 22:48:10,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:10,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:10,828 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:48:10,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:10,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711632317] [2023-11-06 22:48:10,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711632317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:10,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:10,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894332184] [2023-11-06 22:48:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:10,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:10,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:10,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:10,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:10,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 289 [2023-11-06 22:48:10,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 298 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:48:10,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:10,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 289 [2023-11-06 22:48:10,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:11,840 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L771-->L787: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_52 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd2~0_52 256) 0))) (let ((.cse6 (not .cse3)) (.cse12 (= (mod v_~y$w_buff0_used~0_128 256) 0)) (.cse5 (and .cse3 .cse8)) (.cse11 (and (= 0 (mod v_~y$w_buff1_used~0_115 256)) .cse3))) (let ((.cse9 (or .cse12 .cse5 .cse11)) (.cse10 (and (not .cse12) .cse6))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_114 256) 0)) (.cse1 (ite .cse9 v_~y~0_86 (ite .cse10 v_~y$w_buff0~0_59 v_~y$w_buff1~0_52))) (.cse0 (not (= (mod v_~weak$$choice2~0_40 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_127 256) 0))) (and (= v_~y~0_86 v_~y$mem_tmp~0_24) (= v_~y$w_buff0~0_59 v_~y$w_buff0~0_58) (= v_~y~0_84 (ite .cse0 v_~y$mem_tmp~0_24 .cse1)) (= v_~y$r_buff0_thd2~0_51 (ite .cse0 v_~y$r_buff0_thd2~0_52 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~y$r_buff0_thd2~0_52 (ite (and .cse6 (not .cse2)) 0 v_~y$r_buff0_thd2~0_52)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_52 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd2~0_51 256) 0))) (or .cse2 (and .cse7 .cse8) (and .cse7 .cse4))) v_~y$r_buff1_thd2~0_52 0)) v_~y$r_buff1_thd2~0_51) (= 0 v_~y$flush_delayed~0_27) (= v_~y$w_buff0_used~0_127 (ite .cse0 v_~y$w_buff0_used~0_128 (ite .cse9 v_~y$w_buff0_used~0_128 (ite .cse10 0 v_~y$w_buff0_used~0_128)))) (= v_~__unbuffered_p1_EBX~0_12 .cse1) (= v_~y$w_buff1~0_52 v_~y$w_buff1~0_51) (= v_~y$w_buff1_used~0_114 (ite .cse0 v_~y$w_buff1_used~0_115 (ite (or .cse2 .cse5 .cse11) v_~y$w_buff1_used~0_115 0)))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_52, ~y$w_buff0~0=v_~y$w_buff0~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, P1Thread1of1ForFork3_#t~nondet4=|v_P1Thread1of1ForFork3_#t~nondet4_1|, P1Thread1of1ForFork3_#t~nondet3=|v_P1Thread1of1ForFork3_#t~nondet3_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~y~0=v_~y~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork3_#t~nondet4, P1Thread1of1ForFork3_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][66], [Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork3InUse, 205#(= ~x~0 1), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 47#L787true, Black: 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 50#P2EXITtrue, 87#L835true, 81#L2true, Black: 172#(<= ~__unbuffered_p3_EAX~0 0), 217#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 206#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 203#true, 185#true, 180#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 163#true, 142#L756true, P3Thread1of1ForFork0InUse, Black: 187#(= ~__unbuffered_p1_EAX~0 0)]) [2023-11-06 22:48:11,841 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 22:48:11,841 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:48:11,841 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:48:11,841 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:48:11,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L771-->L787: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_52 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd2~0_52 256) 0))) (let ((.cse6 (not .cse3)) (.cse12 (= (mod v_~y$w_buff0_used~0_128 256) 0)) (.cse5 (and .cse3 .cse8)) (.cse11 (and (= 0 (mod v_~y$w_buff1_used~0_115 256)) .cse3))) (let ((.cse9 (or .cse12 .cse5 .cse11)) (.cse10 (and (not .cse12) .cse6))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_114 256) 0)) (.cse1 (ite .cse9 v_~y~0_86 (ite .cse10 v_~y$w_buff0~0_59 v_~y$w_buff1~0_52))) (.cse0 (not (= (mod v_~weak$$choice2~0_40 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_127 256) 0))) (and (= v_~y~0_86 v_~y$mem_tmp~0_24) (= v_~y$w_buff0~0_59 v_~y$w_buff0~0_58) (= v_~y~0_84 (ite .cse0 v_~y$mem_tmp~0_24 .cse1)) (= v_~y$r_buff0_thd2~0_51 (ite .cse0 v_~y$r_buff0_thd2~0_52 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~y$r_buff0_thd2~0_52 (ite (and .cse6 (not .cse2)) 0 v_~y$r_buff0_thd2~0_52)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_52 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd2~0_51 256) 0))) (or .cse2 (and .cse7 .cse8) (and .cse7 .cse4))) v_~y$r_buff1_thd2~0_52 0)) v_~y$r_buff1_thd2~0_51) (= 0 v_~y$flush_delayed~0_27) (= v_~y$w_buff0_used~0_127 (ite .cse0 v_~y$w_buff0_used~0_128 (ite .cse9 v_~y$w_buff0_used~0_128 (ite .cse10 0 v_~y$w_buff0_used~0_128)))) (= v_~__unbuffered_p1_EBX~0_12 .cse1) (= v_~y$w_buff1~0_52 v_~y$w_buff1~0_51) (= v_~y$w_buff1_used~0_114 (ite .cse0 v_~y$w_buff1_used~0_115 (ite (or .cse2 .cse5 .cse11) v_~y$w_buff1_used~0_115 0)))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_52, ~y$w_buff0~0=v_~y$w_buff0~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, P1Thread1of1ForFork3_#t~nondet4=|v_P1Thread1of1ForFork3_#t~nondet4_1|, P1Thread1of1ForFork3_#t~nondet3=|v_P1Thread1of1ForFork3_#t~nondet3_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~y~0=v_~y~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork3_#t~nondet4, P1Thread1of1ForFork3_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][81], [Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork3InUse, 205#(= ~x~0 1), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 47#L787true, Black: 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 50#P2EXITtrue, 87#L835true, 81#L2true, Black: 172#(<= ~__unbuffered_p3_EAX~0 0), 217#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 206#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 203#true, 185#true, 180#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 163#true, 142#L756true, P3Thread1of1ForFork0InUse, Black: 187#(= ~__unbuffered_p1_EAX~0 0)]) [2023-11-06 22:48:11,842 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 22:48:11,842 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:48:11,842 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:48:11,842 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:48:11,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L756-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0][82], [P1Thread1of1ForFork3InUse, 205#(= ~x~0 1), 37#L771true, Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 50#P2EXITtrue, 215#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 87#L835true, 81#L2true, Black: 172#(<= ~__unbuffered_p3_EAX~0 0), Black: 206#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 115#P0EXITtrue, Black: 203#true, 180#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 163#true, 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 185#true, P3Thread1of1ForFork0InUse, Black: 187#(= ~__unbuffered_p1_EAX~0 0)]) [2023-11-06 22:48:11,843 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 22:48:11,843 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:48:11,843 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:48:11,843 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:48:12,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L756-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0][82], [P1Thread1of1ForFork3InUse, 205#(= ~x~0 1), Black: 195#(= ~__unbuffered_cnt~0 0), 47#L787true, Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 50#P2EXITtrue, 215#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 87#L835true, 81#L2true, Black: 172#(<= ~__unbuffered_p3_EAX~0 0), Black: 206#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 115#P0EXITtrue, Black: 203#true, 180#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 185#true, 163#true, P3Thread1of1ForFork0InUse, Black: 187#(= ~__unbuffered_p1_EAX~0 0)]) [2023-11-06 22:48:12,016 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 22:48:12,016 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:12,016 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:12,016 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:12,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L756-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0][116], [P1Thread1of1ForFork3InUse, 205#(= ~x~0 1), Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 50#P2EXITtrue, 215#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 87#L835true, 81#L2true, Black: 172#(<= ~__unbuffered_p3_EAX~0 0), 115#P0EXITtrue, Black: 206#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 203#true, 180#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), 123#P1EXITtrue, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 163#true, 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 185#true, P3Thread1of1ForFork0InUse, Black: 187#(= ~__unbuffered_p1_EAX~0 0)]) [2023-11-06 22:48:12,031 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 22:48:12,031 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:12,031 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:12,032 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:12,264 INFO L124 PetriNetUnfolderBase]: 4668/7475 cut-off events. [2023-11-06 22:48:12,264 INFO L125 PetriNetUnfolderBase]: For 9461/9946 co-relation queries the response was YES. [2023-11-06 22:48:12,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25212 conditions, 7475 events. 4668/7475 cut-off events. For 9461/9946 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 49575 event pairs, 603 based on Foata normal form. 745/7946 useless extension candidates. Maximal degree in co-relation 25199. Up to 3048 conditions per place. [2023-11-06 22:48:12,342 INFO L140 encePairwiseOnDemand]: 282/289 looper letters, 91 selfloop transitions, 14 changer transitions 2/123 dead transitions. [2023-11-06 22:48:12,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 123 transitions, 900 flow [2023-11-06 22:48:12,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:48:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:48:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 853 transitions. [2023-11-06 22:48:12,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49192618223760093 [2023-11-06 22:48:12,348 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 853 transitions. [2023-11-06 22:48:12,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 853 transitions. [2023-11-06 22:48:12,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:12,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 853 transitions. [2023-11-06 22:48:12,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.16666666666666) internal successors, (853), 6 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have 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:48:12,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have 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:48:12,361 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have 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:48:12,361 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 298 flow. Second operand 6 states and 853 transitions. [2023-11-06 22:48:12,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 123 transitions, 900 flow [2023-11-06 22:48:12,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 123 transitions, 898 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:12,432 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 416 flow [2023-11-06 22:48:12,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=416, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2023-11-06 22:48:12,435 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-11-06 22:48:12,435 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 416 flow [2023-11-06 22:48:12,436 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:48:12,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:12,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:12,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:48:12,437 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:12,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:12,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1157299958, now seen corresponding path program 1 times [2023-11-06 22:48:12,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:12,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437223843] [2023-11-06 22:48:12,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:12,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:12,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:48:12,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:12,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437223843] [2023-11-06 22:48:12,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437223843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:12,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:12,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:12,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360953925] [2023-11-06 22:48:12,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:12,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:12,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:12,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:12,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:12,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 289 [2023-11-06 22:48:12,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 416 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:12,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:12,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 289 [2023-11-06 22:48:12,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:14,333 INFO L124 PetriNetUnfolderBase]: 6887/11034 cut-off events. [2023-11-06 22:48:14,333 INFO L125 PetriNetUnfolderBase]: For 27523/28457 co-relation queries the response was YES. [2023-11-06 22:48:14,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46605 conditions, 11034 events. 6887/11034 cut-off events. For 27523/28457 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 76185 event pairs, 1629 based on Foata normal form. 138/10854 useless extension candidates. Maximal degree in co-relation 46589. Up to 5924 conditions per place. [2023-11-06 22:48:14,409 INFO L140 encePairwiseOnDemand]: 286/289 looper letters, 92 selfloop transitions, 5 changer transitions 11/120 dead transitions. [2023-11-06 22:48:14,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 120 transitions, 1079 flow [2023-11-06 22:48:14,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:14,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 582 transitions. [2023-11-06 22:48:14,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034602076124568 [2023-11-06 22:48:14,413 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 582 transitions. [2023-11-06 22:48:14,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 582 transitions. [2023-11-06 22:48:14,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:14,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 582 transitions. [2023-11-06 22:48:14,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have 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:48:14,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have 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:48:14,420 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have 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:48:14,420 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 416 flow. Second operand 4 states and 582 transitions. [2023-11-06 22:48:14,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 120 transitions, 1079 flow [2023-11-06 22:48:15,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 120 transitions, 961 flow, removed 47 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:15,150 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 423 flow [2023-11-06 22:48:15,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=423, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2023-11-06 22:48:15,151 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2023-11-06 22:48:15,151 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 423 flow [2023-11-06 22:48:15,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:15,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:15,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:15,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:48:15,152 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:15,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:15,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1132138236, now seen corresponding path program 1 times [2023-11-06 22:48:15,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:15,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075250737] [2023-11-06 22:48:15,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:15,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:15,378 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:48:15,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:15,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075250737] [2023-11-06 22:48:15,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075250737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:15,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:15,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:15,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788804746] [2023-11-06 22:48:15,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:15,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:15,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:15,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:15,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:15,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 289 [2023-11-06 22:48:15,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 60 transitions, 423 flow. Second operand has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have 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:48:15,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:15,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 289 [2023-11-06 22:48:15,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:17,967 INFO L124 PetriNetUnfolderBase]: 13311/20324 cut-off events. [2023-11-06 22:48:17,968 INFO L125 PetriNetUnfolderBase]: For 51977/51977 co-relation queries the response was YES. [2023-11-06 22:48:18,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83161 conditions, 20324 events. 13311/20324 cut-off events. For 51977/51977 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 135460 event pairs, 2858 based on Foata normal form. 48/20372 useless extension candidates. Maximal degree in co-relation 83143. Up to 10237 conditions per place. [2023-11-06 22:48:18,064 INFO L140 encePairwiseOnDemand]: 279/289 looper letters, 80 selfloop transitions, 16 changer transitions 36/132 dead transitions. [2023-11-06 22:48:18,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 132 transitions, 1129 flow [2023-11-06 22:48:18,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2023-11-06 22:48:18,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4844290657439446 [2023-11-06 22:48:18,068 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2023-11-06 22:48:18,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2023-11-06 22:48:18,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:18,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2023-11-06 22:48:18,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have 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:48:18,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have 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:48:18,074 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have 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:48:18,074 INFO L175 Difference]: Start difference. First operand has 64 places, 60 transitions, 423 flow. Second operand 4 states and 560 transitions. [2023-11-06 22:48:18,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 132 transitions, 1129 flow [2023-11-06 22:48:18,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 132 transitions, 1096 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:18,919 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 422 flow [2023-11-06 22:48:18,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=422, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-11-06 22:48:18,920 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2023-11-06 22:48:18,920 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 422 flow [2023-11-06 22:48:18,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have 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:48:18,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:18,921 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:48:18,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:48:18,921 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:18,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:18,922 INFO L85 PathProgramCache]: Analyzing trace with hash 987261836, now seen corresponding path program 1 times [2023-11-06 22:48:18,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:18,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764839640] [2023-11-06 22:48:18,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:18,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:19,136 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:48:19,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:19,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764839640] [2023-11-06 22:48:19,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764839640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:19,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:19,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:48:19,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428717385] [2023-11-06 22:48:19,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:19,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:48:19,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:19,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:48:19,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:48:19,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 289 [2023-11-06 22:48:19,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 422 flow. Second operand has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have 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:48:19,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:19,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 289 [2023-11-06 22:48:19,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:20,636 INFO L124 PetriNetUnfolderBase]: 4888/8371 cut-off events. [2023-11-06 22:48:20,636 INFO L125 PetriNetUnfolderBase]: For 14696/15179 co-relation queries the response was YES. [2023-11-06 22:48:20,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31132 conditions, 8371 events. 4888/8371 cut-off events. For 14696/15179 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 62216 event pairs, 632 based on Foata normal form. 811/8941 useless extension candidates. Maximal degree in co-relation 31113. Up to 2917 conditions per place. [2023-11-06 22:48:20,684 INFO L140 encePairwiseOnDemand]: 282/289 looper letters, 85 selfloop transitions, 17 changer transitions 34/148 dead transitions. [2023-11-06 22:48:20,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 148 transitions, 1303 flow [2023-11-06 22:48:20,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:48:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 995 transitions. [2023-11-06 22:48:20,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49184379634206626 [2023-11-06 22:48:20,689 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 995 transitions. [2023-11-06 22:48:20,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 995 transitions. [2023-11-06 22:48:20,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:20,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 995 transitions. [2023-11-06 22:48:20,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.14285714285714) internal successors, (995), 7 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have 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:48:20,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have 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:48:20,701 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have 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:48:20,701 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 422 flow. Second operand 7 states and 995 transitions. [2023-11-06 22:48:20,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 148 transitions, 1303 flow [2023-11-06 22:48:20,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 148 transitions, 1299 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:20,746 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 489 flow [2023-11-06 22:48:20,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=489, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2023-11-06 22:48:20,747 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2023-11-06 22:48:20,747 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 489 flow [2023-11-06 22:48:20,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have 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:48:20,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:20,748 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:48:20,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:48:20,748 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:20,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:20,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1272978731, now seen corresponding path program 1 times [2023-11-06 22:48:20,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:20,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085961859] [2023-11-06 22:48:20,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:20,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:21,613 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:48:21,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:21,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085961859] [2023-11-06 22:48:21,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085961859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:21,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:21,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:21,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449248169] [2023-11-06 22:48:21,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:21,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:48:21,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:21,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:48:21,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:48:21,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 289 [2023-11-06 22:48:21,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 489 flow. Second operand has 6 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have 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:48:21,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:21,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 289 [2023-11-06 22:48:21,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:23,124 INFO L124 PetriNetUnfolderBase]: 5088/9144 cut-off events. [2023-11-06 22:48:23,124 INFO L125 PetriNetUnfolderBase]: For 27015/27319 co-relation queries the response was YES. [2023-11-06 22:48:23,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40261 conditions, 9144 events. 5088/9144 cut-off events. For 27015/27319 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 72012 event pairs, 1045 based on Foata normal form. 58/8910 useless extension candidates. Maximal degree in co-relation 40239. Up to 5646 conditions per place. [2023-11-06 22:48:23,174 INFO L140 encePairwiseOnDemand]: 282/289 looper letters, 77 selfloop transitions, 9 changer transitions 50/148 dead transitions. [2023-11-06 22:48:23,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 148 transitions, 1425 flow [2023-11-06 22:48:23,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:48:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 989 transitions. [2023-11-06 22:48:23,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888779041028176 [2023-11-06 22:48:23,178 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 989 transitions. [2023-11-06 22:48:23,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 989 transitions. [2023-11-06 22:48:23,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:23,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 989 transitions. [2023-11-06 22:48:23,183 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:48:23,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have 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:48:23,188 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have 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:48:23,188 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 489 flow. Second operand 7 states and 989 transitions. [2023-11-06 22:48:23,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 148 transitions, 1425 flow [2023-11-06 22:48:23,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 148 transitions, 1222 flow, removed 65 selfloop flow, removed 3 redundant places. [2023-11-06 22:48:23,774 INFO L231 Difference]: Finished difference. Result has 80 places, 65 transitions, 473 flow [2023-11-06 22:48:23,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=473, PETRI_PLACES=80, PETRI_TRANSITIONS=65} [2023-11-06 22:48:23,775 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2023-11-06 22:48:23,775 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 65 transitions, 473 flow [2023-11-06 22:48:23,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have 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:48:23,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:23,776 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:48:23,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:48:23,776 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:23,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:23,777 INFO L85 PathProgramCache]: Analyzing trace with hash -485357981, now seen corresponding path program 1 times [2023-11-06 22:48:23,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:23,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551573096] [2023-11-06 22:48:23,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:23,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:24,046 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:48:24,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:24,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551573096] [2023-11-06 22:48:24,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551573096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:24,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:24,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:48:24,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068992280] [2023-11-06 22:48:24,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:24,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:48:24,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:24,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:48:24,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:48:24,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 289 [2023-11-06 22:48:24,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 65 transitions, 473 flow. Second operand has 7 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have 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:48:24,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:24,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 289 [2023-11-06 22:48:24,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:25,418 INFO L124 PetriNetUnfolderBase]: 3908/7025 cut-off events. [2023-11-06 22:48:25,418 INFO L125 PetriNetUnfolderBase]: For 13066/13359 co-relation queries the response was YES. [2023-11-06 22:48:25,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28272 conditions, 7025 events. 3908/7025 cut-off events. For 13066/13359 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 54336 event pairs, 414 based on Foata normal form. 236/7061 useless extension candidates. Maximal degree in co-relation 28245. Up to 2043 conditions per place. [2023-11-06 22:48:25,463 INFO L140 encePairwiseOnDemand]: 282/289 looper letters, 43 selfloop transitions, 17 changer transitions 81/146 dead transitions. [2023-11-06 22:48:25,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 146 transitions, 1242 flow [2023-11-06 22:48:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:48:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:48:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1253 transitions. [2023-11-06 22:48:25,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817377931564783 [2023-11-06 22:48:25,469 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1253 transitions. [2023-11-06 22:48:25,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1253 transitions. [2023-11-06 22:48:25,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:25,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1253 transitions. [2023-11-06 22:48:25,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 139.22222222222223) internal successors, (1253), 9 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have 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:48:25,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 289.0) internal successors, (2890), 10 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have 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:48:25,481 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 289.0) internal successors, (2890), 10 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have 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:48:25,481 INFO L175 Difference]: Start difference. First operand has 80 places, 65 transitions, 473 flow. Second operand 9 states and 1253 transitions. [2023-11-06 22:48:25,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 146 transitions, 1242 flow [2023-11-06 22:48:25,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 146 transitions, 1212 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-11-06 22:48:25,834 INFO L231 Difference]: Finished difference. Result has 85 places, 43 transitions, 320 flow [2023-11-06 22:48:25,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=320, PETRI_PLACES=85, PETRI_TRANSITIONS=43} [2023-11-06 22:48:25,835 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 33 predicate places. [2023-11-06 22:48:25,835 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 43 transitions, 320 flow [2023-11-06 22:48:25,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have 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:48:25,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:25,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:25,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:48:25,837 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:25,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash 149664860, now seen corresponding path program 1 times [2023-11-06 22:48:25,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:25,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108736038] [2023-11-06 22:48:25,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:25,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:48:25,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:48:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:48:26,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:48:26,004 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:48:26,005 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:48:26,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:48:26,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:48:26,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:48:26,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:48:26,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:48:26,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:48:26,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:48:26,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:48:26,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:48:26,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:48:26,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:48:26,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:48:26,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:48:26,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:48:26,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:48:26,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:48:26,013 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:26,019 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:48:26,020 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:48:26,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:48:26 BasicIcfg [2023-11-06 22:48:26,136 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:48:26,137 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:48:26,137 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:48:26,137 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:48:26,138 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:50" (3/4) ... [2023-11-06 22:48:26,140 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:48:26,141 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:48:26,142 INFO L158 Benchmark]: Toolchain (without parser) took 37820.33ms. Allocated memory was 199.2MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 166.9MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-06 22:48:26,142 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 130.0MB. Free memory was 102.6MB in the beginning and 102.5MB in the end (delta: 135.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:48:26,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 663.34ms. Allocated memory is still 199.2MB. Free memory was 166.7MB in the beginning and 146.1MB in the end (delta: 20.6MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2023-11-06 22:48:26,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.45ms. Allocated memory is still 199.2MB. Free memory was 146.1MB in the beginning and 144.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:48:26,144 INFO L158 Benchmark]: Boogie Preprocessor took 36.69ms. Allocated memory is still 199.2MB. Free memory was 144.0MB in the beginning and 141.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:48:26,144 INFO L158 Benchmark]: RCFGBuilder took 918.07ms. Allocated memory is still 199.2MB. Free memory was 141.9MB in the beginning and 131.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:48:26,144 INFO L158 Benchmark]: TraceAbstraction took 36131.44ms. Allocated memory was 199.2MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 131.4MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-11-06 22:48:26,145 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 3.8GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:48:26,148 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.24ms. Allocated memory is still 130.0MB. Free memory was 102.6MB in the beginning and 102.5MB in the end (delta: 135.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 663.34ms. Allocated memory is still 199.2MB. Free memory was 166.7MB in the beginning and 146.1MB in the end (delta: 20.6MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.45ms. Allocated memory is still 199.2MB. Free memory was 146.1MB in the beginning and 144.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.69ms. Allocated memory is still 199.2MB. Free memory was 144.0MB in the beginning and 141.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 918.07ms. Allocated memory is still 199.2MB. Free memory was 141.9MB in the beginning and 131.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 36131.44ms. Allocated memory was 199.2MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 131.4MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 3.8GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 156 PlacesBefore, 52 PlacesAfterwards, 146 TransitionsBefore, 40 TransitionsAfterwards, 3842 CoEnabledTransitionPairs, 8 FixpointIterations, 47 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 139 TotalNumberOfCompositions, 10810 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5162, independent: 4900, independent conditional: 0, independent unconditional: 4900, dependent: 262, dependent conditional: 0, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2071, independent: 2020, independent conditional: 0, independent unconditional: 2020, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5162, independent: 2880, independent conditional: 0, independent unconditional: 2880, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 2071, unknown conditional: 0, unknown unconditional: 2071] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 178, Positive conditional cache size: 0, Positive unconditional cache size: 178, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L859] 0 pthread_t t605; [L860] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t605, ((void *)0), P0, ((void *)0))=-3, t605={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L861] 0 pthread_t t606; [L862] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t606, ((void *)0), P1, ((void *)0))=-2, t605={5:0}, t606={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L863] 0 pthread_t t607; [L864] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t607, ((void *)0), P2, ((void *)0))=-1, t605={5:0}, t606={6:0}, t607={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 y$w_buff1 = y$w_buff0 [L799] 3 y$w_buff0 = 1 [L800] 3 y$w_buff1_used = y$w_buff0_used [L801] 3 y$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L803] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L804] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L805] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L806] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L807] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L808] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L865] 0 pthread_t t608; [L866] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t608, ((void *)0), P3, ((void *)0))=0, t605={5:0}, t606={6:0}, t607={7:0}, t608={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L828] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L834] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L770] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 y$flush_delayed = weak$$choice2 [L776] 2 y$mem_tmp = y [L777] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L778] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = y [L785] 2 y = y$flush_delayed ? y$mem_tmp : y [L786] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L814] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L837] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L838] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L839] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L840] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L841] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L873] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L874] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L875] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L876] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t605={5:0}, t606={6:0}, t607={7:0}, t608={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L881] 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", "mix023_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - 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: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 860]: 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: 866]: 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: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 672 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 553 mSDsluCounter, 154 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1846 IncrementalHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 60 mSDtfsCounter, 1846 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=489occurred in iteration=11, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 1076 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:48:26,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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_d637f30e-3ea7-4f31-ae49-854970abbd64/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 28f58acc3eb15266c6a84eca373e682a200492b696916dc340e2c03025141f5c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:48:28,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:48:28,997 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:48:29,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:48:29,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:48:29,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:48:29,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:48:29,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:48:29,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:48:29,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:48:29,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:48:29,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:48:29,054 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:48:29,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:48:29,055 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:48:29,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:48:29,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:48:29,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:48:29,057 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:48:29,061 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:48:29,062 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:48:29,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:48:29,063 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:48:29,064 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:48:29,064 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:48:29,065 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:48:29,065 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:48:29,065 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:48:29,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:48:29,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:48:29,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:48:29,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:48:29,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:48:29,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:48:29,069 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:48:29,069 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:48:29,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:48:29,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:48:29,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:48:29,071 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:48:29,072 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:48:29,072 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_d637f30e-3ea7-4f31-ae49-854970abbd64/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_d637f30e-3ea7-4f31-ae49-854970abbd64/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 -> 28f58acc3eb15266c6a84eca373e682a200492b696916dc340e2c03025141f5c [2023-11-06 22:48:29,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:48:29,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:48:29,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:48:29,501 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:48:29,501 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:48:29,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2023-11-06 22:48:32,868 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:48:33,312 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:48:33,313 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2023-11-06 22:48:33,338 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/data/2a2986c35/da3c6c173c6f456391ea414593908ea0/FLAG07af0a5e8 [2023-11-06 22:48:33,356 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/data/2a2986c35/da3c6c173c6f456391ea414593908ea0 [2023-11-06 22:48:33,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:48:33,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:48:33,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:48:33,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:48:33,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:48:33,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:33" (1/1) ... [2023-11-06 22:48:33,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc43f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:33, skipping insertion in model container [2023-11-06 22:48:33,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:33" (1/1) ... [2023-11-06 22:48:33,440 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:48:33,905 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:48:33,922 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:48:33,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:48:34,029 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:48:34,029 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:48:34,037 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:48:34,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:34 WrapperNode [2023-11-06 22:48:34,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:48:34,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:48:34,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:48:34,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:48:34,048 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:48:34" (1/1) ... [2023-11-06 22:48:34,096 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:48:34" (1/1) ... [2023-11-06 22:48:34,147 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-06 22:48:34,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:48:34,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:48:34,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:48:34,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:48:34,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:34" (1/1) ... [2023-11-06 22:48:34,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:34" (1/1) ... [2023-11-06 22:48:34,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:34" (1/1) ... [2023-11-06 22:48:34,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:34" (1/1) ... [2023-11-06 22:48:34,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:34" (1/1) ... [2023-11-06 22:48:34,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:34" (1/1) ... [2023-11-06 22:48:34,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:34" (1/1) ... [2023-11-06 22:48:34,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:34" (1/1) ... [2023-11-06 22:48:34,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:48:34,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:48:34,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:48:34,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:48:34,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:34" (1/1) ... [2023-11-06 22:48:34,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:48:34,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:48:34,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:34,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:34,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:48:34,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:48:34,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:48:34,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:48:34,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:48:34,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:48:34,319 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:48:34,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:48:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:48:34,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:48:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:48:34,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:48:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:48:34,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:48:34,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:48:34,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:48:34,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:48:34,325 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:48:34,510 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:48:34,511 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:48:34,980 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:48:35,178 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:48:35,179 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:48:35,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:35 BoogieIcfgContainer [2023-11-06 22:48:35,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:48:35,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:48:35,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:48:35,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:48:35,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:48:33" (1/3) ... [2023-11-06 22:48:35,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d211428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:35, skipping insertion in model container [2023-11-06 22:48:35,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:34" (2/3) ... [2023-11-06 22:48:35,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d211428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:35, skipping insertion in model container [2023-11-06 22:48:35,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:35" (3/3) ... [2023-11-06 22:48:35,196 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.opt_pso.opt_rmo.opt.i [2023-11-06 22:48:35,215 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:48:35,216 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:48:35,216 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:48:35,309 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:48:35,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 151 transitions, 318 flow [2023-11-06 22:48:35,466 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-06 22:48:35,467 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:48:35,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 120 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-06 22:48:35,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 151 transitions, 318 flow [2023-11-06 22:48:35,483 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 147 transitions, 306 flow [2023-11-06 22:48:35,487 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:48:35,504 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-06 22:48:35,508 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-06 22:48:35,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 147 transitions, 306 flow [2023-11-06 22:48:35,599 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-06 22:48:35,605 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:48:35,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 121 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-06 22:48:35,610 INFO L119 LiptonReduction]: Number of co-enabled transitions 3842 [2023-11-06 22:48:46,229 INFO L134 LiptonReduction]: Checked pairs total: 10127 [2023-11-06 22:48:46,229 INFO L136 LiptonReduction]: Total number of compositions: 149 [2023-11-06 22:48:46,245 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:48:46,252 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;@3bf0bae9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:48:46,252 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:48:46,255 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:48:46,255 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:48:46,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:48:46,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:46,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:48:46,256 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:46,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:46,262 INFO L85 PathProgramCache]: Analyzing trace with hash 642, now seen corresponding path program 1 times [2023-11-06 22:48:46,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:46,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128172855] [2023-11-06 22:48:46,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:46,276 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:48:46,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:46,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:46,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:48:46,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:46,414 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:48:46,414 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:46,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:46,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128172855] [2023-11-06 22:48:46,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128172855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:46,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:46,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:48:46,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369576111] [2023-11-06 22:48:46,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:46,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:48:46,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:46,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:48:46,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:48:46,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 300 [2023-11-06 22:48:46,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 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:48:46,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:46,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 300 [2023-11-06 22:48:46,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:47,763 INFO L124 PetriNetUnfolderBase]: 5049/7088 cut-off events. [2023-11-06 22:48:47,764 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-06 22:48:47,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14126 conditions, 7088 events. 5049/7088 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 38014 event pairs, 5049 based on Foata normal form. 0/6055 useless extension candidates. Maximal degree in co-relation 14114. Up to 6881 conditions per place. [2023-11-06 22:48:47,834 INFO L140 encePairwiseOnDemand]: 291/300 looper letters, 26 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-11-06 22:48:47,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 126 flow [2023-11-06 22:48:47,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:48:47,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:48:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2023-11-06 22:48:47,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515 [2023-11-06 22:48:47,859 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2023-11-06 22:48:47,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2023-11-06 22:48:47,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:47,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2023-11-06 22:48:47,873 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:48:47,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have 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:48:47,880 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have 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:48:47,882 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 309 transitions. [2023-11-06 22:48:47,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 126 flow [2023-11-06 22:48:47,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:48:47,893 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-11-06 22:48:47,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-11-06 22:48:47,899 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-11-06 22:48:47,900 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-11-06 22:48:47,900 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:48:47,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:47,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:47,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:48,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:48,115 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:48,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1217048492, now seen corresponding path program 1 times [2023-11-06 22:48:48,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:48,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023715284] [2023-11-06 22:48:48,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:48,118 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:48:48,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:48,120 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:48,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:48:48,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:48,294 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:48:48,295 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:48,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:48,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023715284] [2023-11-06 22:48:48,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023715284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:48,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:48,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:48:48,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171336647] [2023-11-06 22:48:48,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:48,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:48,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:48,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:48,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:48,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 300 [2023-11-06 22:48:48,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have 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:48:48,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:48,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 300 [2023-11-06 22:48:48,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:49,335 INFO L124 PetriNetUnfolderBase]: 3975/5861 cut-off events. [2023-11-06 22:48:49,335 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:48:49,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11438 conditions, 5861 events. 3975/5861 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 34480 event pairs, 753 based on Foata normal form. 0/5425 useless extension candidates. Maximal degree in co-relation 11435. Up to 4303 conditions per place. [2023-11-06 22:48:49,388 INFO L140 encePairwiseOnDemand]: 297/300 looper letters, 37 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2023-11-06 22:48:49,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 184 flow [2023-11-06 22:48:49,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:49,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-11-06 22:48:49,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-06 22:48:49,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-11-06 22:48:49,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-11-06 22:48:49,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:49,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-11-06 22:48:49,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have 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:48:49,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have 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:48:49,410 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have 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:48:49,410 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 450 transitions. [2023-11-06 22:48:49,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 184 flow [2023-11-06 22:48:49,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:48:49,413 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-11-06 22:48:49,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-06 22:48:49,414 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-11-06 22:48:49,414 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-11-06 22:48:49,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have 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:48:49,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:49,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:49,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:49,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:49,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:49,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:49,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1550917652, now seen corresponding path program 1 times [2023-11-06 22:48:49,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:49,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725940050] [2023-11-06 22:48:49,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:49,629 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:48:49,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:49,631 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:49,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:49,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:48:49,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:49,809 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:48:49,809 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:49,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:49,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725940050] [2023-11-06 22:48:49,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725940050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:49,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:49,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:49,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679141252] [2023-11-06 22:48:49,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:49,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:49,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:49,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:49,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:49,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 300 [2023-11-06 22:48:49,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 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:48:49,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:49,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 300 [2023-11-06 22:48:49,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:50,654 INFO L124 PetriNetUnfolderBase]: 2757/4005 cut-off events. [2023-11-06 22:48:50,654 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2023-11-06 22:48:50,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8366 conditions, 4005 events. 2757/4005 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 21238 event pairs, 542 based on Foata normal form. 192/4027 useless extension candidates. Maximal degree in co-relation 8362. Up to 3074 conditions per place. [2023-11-06 22:48:50,693 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 36 selfloop transitions, 5 changer transitions 23/69 dead transitions. [2023-11-06 22:48:50,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 290 flow [2023-11-06 22:48:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:48:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:48:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 716 transitions. [2023-11-06 22:48:50,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47733333333333333 [2023-11-06 22:48:50,697 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 716 transitions. [2023-11-06 22:48:50,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 716 transitions. [2023-11-06 22:48:50,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:50,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 716 transitions. [2023-11-06 22:48:50,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have 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:48:50,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have 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:48:50,706 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have 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:48:50,706 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 5 states and 716 transitions. [2023-11-06 22:48:50,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 290 flow [2023-11-06 22:48:50,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:50,710 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 111 flow [2023-11-06 22:48:50,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-11-06 22:48:50,712 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2023-11-06 22:48:50,713 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 111 flow [2023-11-06 22:48:50,713 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:48:50,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:50,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:50,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:50,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:50,925 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:50,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:50,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1112194136, now seen corresponding path program 1 times [2023-11-06 22:48:50,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:50,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828217413] [2023-11-06 22:48:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:50,927 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:48:50,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:50,928 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:50,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:51,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:48:51,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:51,108 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:48:51,109 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:51,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:51,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828217413] [2023-11-06 22:48:51,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828217413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:51,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:51,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:51,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058543339] [2023-11-06 22:48:51,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:51,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:51,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:51,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:51,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:51,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 300 [2023-11-06 22:48:51,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:51,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:51,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 300 [2023-11-06 22:48:51,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:51,732 INFO L124 PetriNetUnfolderBase]: 1407/2196 cut-off events. [2023-11-06 22:48:51,732 INFO L125 PetriNetUnfolderBase]: For 891/891 co-relation queries the response was YES. [2023-11-06 22:48:51,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5965 conditions, 2196 events. 1407/2196 cut-off events. For 891/891 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11354 event pairs, 231 based on Foata normal form. 138/2259 useless extension candidates. Maximal degree in co-relation 5958. Up to 1054 conditions per place. [2023-11-06 22:48:51,748 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 47 selfloop transitions, 9 changer transitions 23/84 dead transitions. [2023-11-06 22:48:51,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 431 flow [2023-11-06 22:48:51,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:48:51,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:48:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 861 transitions. [2023-11-06 22:48:51,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47833333333333333 [2023-11-06 22:48:51,757 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 861 transitions. [2023-11-06 22:48:51,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 861 transitions. [2023-11-06 22:48:51,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:51,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 861 transitions. [2023-11-06 22:48:51,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have 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:48:51,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have 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:48:51,767 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have 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:48:51,767 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 111 flow. Second operand 6 states and 861 transitions. [2023-11-06 22:48:51,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 431 flow [2023-11-06 22:48:51,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 424 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:51,784 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 176 flow [2023-11-06 22:48:51,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-11-06 22:48:51,786 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-11-06 22:48:51,786 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 176 flow [2023-11-06 22:48:51,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:51,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:51,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:51,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:51,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:51,999 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:51,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash 747343015, now seen corresponding path program 1 times [2023-11-06 22:48:52,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:52,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988509001] [2023-11-06 22:48:52,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:52,000 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:48:52,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:52,002 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:52,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:52,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:48:52,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:52,209 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:48:52,209 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:52,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:52,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988509001] [2023-11-06 22:48:52,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988509001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:52,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:52,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:48:52,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018003225] [2023-11-06 22:48:52,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:52,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:48:52,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:52,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:48:52,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:48:52,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 300 [2023-11-06 22:48:52,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have 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:48:52,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:52,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 300 [2023-11-06 22:48:52,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:52,853 INFO L124 PetriNetUnfolderBase]: 759/1242 cut-off events. [2023-11-06 22:48:52,853 INFO L125 PetriNetUnfolderBase]: For 1315/1315 co-relation queries the response was YES. [2023-11-06 22:48:52,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3900 conditions, 1242 events. 759/1242 cut-off events. For 1315/1315 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5824 event pairs, 169 based on Foata normal form. 57/1271 useless extension candidates. Maximal degree in co-relation 3891. Up to 419 conditions per place. [2023-11-06 22:48:52,865 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 56 selfloop transitions, 13 changer transitions 23/97 dead transitions. [2023-11-06 22:48:52,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 97 transitions, 592 flow [2023-11-06 22:48:52,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:48:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1004 transitions. [2023-11-06 22:48:52,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4780952380952381 [2023-11-06 22:48:52,871 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1004 transitions. [2023-11-06 22:48:52,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1004 transitions. [2023-11-06 22:48:52,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:52,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1004 transitions. [2023-11-06 22:48:52,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.42857142857142) internal successors, (1004), 7 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have 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:48:52,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have 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:48:52,883 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have 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:48:52,884 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 176 flow. Second operand 7 states and 1004 transitions. [2023-11-06 22:48:52,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 97 transitions, 592 flow [2023-11-06 22:48:52,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 97 transitions, 530 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-11-06 22:48:52,901 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 226 flow [2023-11-06 22:48:52,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-11-06 22:48:52,902 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-11-06 22:48:52,902 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 226 flow [2023-11-06 22:48:52,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have 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:48:52,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:52,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:52,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:53,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:53,116 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:53,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:53,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1519388101, now seen corresponding path program 1 times [2023-11-06 22:48:53,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:53,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773310296] [2023-11-06 22:48:53,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:53,117 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:48:53,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:53,149 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:53,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:48:53,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:53,389 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:48:53,390 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:53,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:53,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773310296] [2023-11-06 22:48:53,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773310296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:53,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:53,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:48:53,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203151991] [2023-11-06 22:48:53,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:53,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:48:53,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:53,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:48:53,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:48:53,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 300 [2023-11-06 22:48:53,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 132.71428571428572) internal successors, (929), 7 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have 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:48:53,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:53,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 300 [2023-11-06 22:48:53,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:54,072 INFO L124 PetriNetUnfolderBase]: 625/1008 cut-off events. [2023-11-06 22:48:54,072 INFO L125 PetriNetUnfolderBase]: For 1022/1022 co-relation queries the response was YES. [2023-11-06 22:48:54,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3040 conditions, 1008 events. 625/1008 cut-off events. For 1022/1022 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4551 event pairs, 164 based on Foata normal form. 12/1003 useless extension candidates. Maximal degree in co-relation 3030. Up to 400 conditions per place. [2023-11-06 22:48:54,083 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 52 selfloop transitions, 17 changer transitions 12/86 dead transitions. [2023-11-06 22:48:54,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 86 transitions, 536 flow [2023-11-06 22:48:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:48:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:48:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1123 transitions. [2023-11-06 22:48:54,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46791666666666665 [2023-11-06 22:48:54,090 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1123 transitions. [2023-11-06 22:48:54,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1123 transitions. [2023-11-06 22:48:54,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:54,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1123 transitions. [2023-11-06 22:48:54,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 140.375) internal successors, (1123), 8 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have 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:48:54,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 300.0) internal successors, (2700), 9 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have 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:48:54,102 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 300.0) internal successors, (2700), 9 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have 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:48:54,103 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 226 flow. Second operand 8 states and 1123 transitions. [2023-11-06 22:48:54,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 86 transitions, 536 flow [2023-11-06 22:48:54,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 86 transitions, 474 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-11-06 22:48:54,122 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 220 flow [2023-11-06 22:48:54,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-11-06 22:48:54,123 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-11-06 22:48:54,124 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 220 flow [2023-11-06 22:48:54,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 132.71428571428572) internal successors, (929), 7 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have 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:48:54,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:54,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:54,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:54,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:54,338 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:54,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:54,338 INFO L85 PathProgramCache]: Analyzing trace with hash 8081322, now seen corresponding path program 1 times [2023-11-06 22:48:54,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:54,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388127922] [2023-11-06 22:48:54,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:54,339 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:48:54,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:54,341 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:54,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:54,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:48:54,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:54,587 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:48:54,587 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:54,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:54,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388127922] [2023-11-06 22:48:54,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388127922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:54,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:54,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:54,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268156523] [2023-11-06 22:48:54,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:54,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:54,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:54,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:54,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:54,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 300 [2023-11-06 22:48:54,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have 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:48:54,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:54,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 300 [2023-11-06 22:48:54,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:55,029 INFO L124 PetriNetUnfolderBase]: 879/1477 cut-off events. [2023-11-06 22:48:55,029 INFO L125 PetriNetUnfolderBase]: For 2029/2029 co-relation queries the response was YES. [2023-11-06 22:48:55,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4354 conditions, 1477 events. 879/1477 cut-off events. For 2029/2029 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7864 event pairs, 145 based on Foata normal form. 0/1469 useless extension candidates. Maximal degree in co-relation 4343. Up to 777 conditions per place. [2023-11-06 22:48:55,043 INFO L140 encePairwiseOnDemand]: 297/300 looper letters, 82 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-11-06 22:48:55,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 665 flow [2023-11-06 22:48:55,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:55,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 587 transitions. [2023-11-06 22:48:55,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891666666666667 [2023-11-06 22:48:55,047 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 587 transitions. [2023-11-06 22:48:55,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 587 transitions. [2023-11-06 22:48:55,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:55,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 587 transitions. [2023-11-06 22:48:55,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have 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:48:55,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 300.0) internal successors, (1500), 5 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:55,055 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 300.0) internal successors, (1500), 5 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:55,055 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 220 flow. Second operand 4 states and 587 transitions. [2023-11-06 22:48:55,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 665 flow [2023-11-06 22:48:55,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 88 transitions, 524 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-11-06 22:48:55,073 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 169 flow [2023-11-06 22:48:55,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-06 22:48:55,074 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-11-06 22:48:55,074 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 169 flow [2023-11-06 22:48:55,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have 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:48:55,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:55,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:55,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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)] Ended with exit code 0 [2023-11-06 22:48:55,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:55,288 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:55,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:55,288 INFO L85 PathProgramCache]: Analyzing trace with hash -56586290, now seen corresponding path program 2 times [2023-11-06 22:48:55,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:55,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832633193] [2023-11-06 22:48:55,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:48:55,289 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:48:55,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:55,291 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:55,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:55,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:48:55,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:48:55,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:48:55,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:55,466 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:48:55,467 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:55,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:55,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832633193] [2023-11-06 22:48:55,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832633193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:55,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:55,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:48:55,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711056266] [2023-11-06 22:48:55,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:55,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:55,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:55,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:55,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:55,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 300 [2023-11-06 22:48:55,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:55,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:55,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 300 [2023-11-06 22:48:55,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:55,842 INFO L124 PetriNetUnfolderBase]: 1515/2445 cut-off events. [2023-11-06 22:48:55,842 INFO L125 PetriNetUnfolderBase]: For 1851/1851 co-relation queries the response was YES. [2023-11-06 22:48:55,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6868 conditions, 2445 events. 1515/2445 cut-off events. For 1851/1851 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13724 event pairs, 677 based on Foata normal form. 1/2401 useless extension candidates. Maximal degree in co-relation 6858. Up to 1402 conditions per place. [2023-11-06 22:48:55,861 INFO L140 encePairwiseOnDemand]: 297/300 looper letters, 67 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-11-06 22:48:55,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 441 flow [2023-11-06 22:48:55,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2023-11-06 22:48:55,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49777777777777776 [2023-11-06 22:48:55,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2023-11-06 22:48:55,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2023-11-06 22:48:55,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:55,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2023-11-06 22:48:55,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have 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:48:55,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have 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:48:55,870 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have 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:48:55,870 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 169 flow. Second operand 3 states and 448 transitions. [2023-11-06 22:48:55,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 441 flow [2023-11-06 22:48:55,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 74 transitions, 440 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:55,907 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 180 flow [2023-11-06 22:48:55,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-11-06 22:48:55,908 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-11-06 22:48:55,909 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 180 flow [2023-11-06 22:48:55,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:55,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:55,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:55,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:56,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:56,122 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:56,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:56,123 INFO L85 PathProgramCache]: Analyzing trace with hash 694075178, now seen corresponding path program 3 times [2023-11-06 22:48:56,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:56,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599535198] [2023-11-06 22:48:56,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:48:56,124 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:48:56,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:56,125 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:56,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:56,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:48:56,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:48:56,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:48:56,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:56,519 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:48:56,519 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:56,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:56,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599535198] [2023-11-06 22:48:56,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599535198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:56,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:56,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:56,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682234684] [2023-11-06 22:48:56,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:56,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:48:56,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:56,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:48:56,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:48:56,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 300 [2023-11-06 22:48:56,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have 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:48:56,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:56,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 300 [2023-11-06 22:48:56,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:57,198 INFO L124 PetriNetUnfolderBase]: 1815/3130 cut-off events. [2023-11-06 22:48:57,198 INFO L125 PetriNetUnfolderBase]: For 3046/3046 co-relation queries the response was YES. [2023-11-06 22:48:57,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9678 conditions, 3130 events. 1815/3130 cut-off events. For 3046/3046 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 19610 event pairs, 348 based on Foata normal form. 1/3110 useless extension candidates. Maximal degree in co-relation 9667. Up to 1023 conditions per place. [2023-11-06 22:48:57,225 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 116 selfloop transitions, 9 changer transitions 0/131 dead transitions. [2023-11-06 22:48:57,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 131 transitions, 858 flow [2023-11-06 22:48:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:48:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 986 transitions. [2023-11-06 22:48:57,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695238095238095 [2023-11-06 22:48:57,230 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 986 transitions. [2023-11-06 22:48:57,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 986 transitions. [2023-11-06 22:48:57,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:57,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 986 transitions. [2023-11-06 22:48:57,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.85714285714286) internal successors, (986), 7 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have 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:48:57,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have 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:48:57,239 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have 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:48:57,239 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 180 flow. Second operand 7 states and 986 transitions. [2023-11-06 22:48:57,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 131 transitions, 858 flow [2023-11-06 22:48:57,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 131 transitions, 854 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:57,341 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 234 flow [2023-11-06 22:48:57,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=234, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2023-11-06 22:48:57,343 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2023-11-06 22:48:57,343 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 234 flow [2023-11-06 22:48:57,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have 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:48:57,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:57,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:57,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:57,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:57,555 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:57,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:57,556 INFO L85 PathProgramCache]: Analyzing trace with hash -991269476, now seen corresponding path program 4 times [2023-11-06 22:48:57,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:57,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927213814] [2023-11-06 22:48:57,556 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:48:57,557 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:48:57,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:57,558 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:57,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:57,685 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:48:57,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:48:57,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:48:57,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:57,707 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:48:57,707 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:57,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:57,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927213814] [2023-11-06 22:48:57,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927213814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:57,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:57,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:48:57,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658424817] [2023-11-06 22:48:57,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:57,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:57,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:57,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:57,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:57,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 300 [2023-11-06 22:48:57,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:57,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:57,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 300 [2023-11-06 22:48:57,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:58,360 INFO L124 PetriNetUnfolderBase]: 2890/4860 cut-off events. [2023-11-06 22:48:58,361 INFO L125 PetriNetUnfolderBase]: For 6481/6533 co-relation queries the response was YES. [2023-11-06 22:48:58,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16818 conditions, 4860 events. 2890/4860 cut-off events. For 6481/6533 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 32242 event pairs, 870 based on Foata normal form. 17/4832 useless extension candidates. Maximal degree in co-relation 16803. Up to 2496 conditions per place. [2023-11-06 22:48:58,407 INFO L140 encePairwiseOnDemand]: 297/300 looper letters, 76 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-11-06 22:48:58,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 83 transitions, 554 flow [2023-11-06 22:48:58,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2023-11-06 22:48:58,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2023-11-06 22:48:58,411 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2023-11-06 22:48:58,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2023-11-06 22:48:58,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:58,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2023-11-06 22:48:58,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have 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:48:58,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have 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:48:58,416 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have 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:48:58,416 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 234 flow. Second operand 3 states and 444 transitions. [2023-11-06 22:48:58,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 83 transitions, 554 flow [2023-11-06 22:48:58,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 83 transitions, 553 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:58,573 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 245 flow [2023-11-06 22:48:58,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2023-11-06 22:48:58,574 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2023-11-06 22:48:58,574 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 245 flow [2023-11-06 22:48:58,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:58,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:58,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:58,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:58,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:48:58,777 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:48:58,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:58,777 INFO L85 PathProgramCache]: Analyzing trace with hash -200281312, now seen corresponding path program 5 times [2023-11-06 22:48:58,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:58,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337437794] [2023-11-06 22:48:58,778 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:48:58,778 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:48:58,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:58,779 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:58,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:48:58,928 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:48:58,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:48:58,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:48:58,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:59,358 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:48:59,358 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:59,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:59,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337437794] [2023-11-06 22:48:59,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337437794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:59,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:59,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:48:59,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074833794] [2023-11-06 22:48:59,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:59,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:48:59,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:59,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:48:59,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:48:59,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 300 [2023-11-06 22:48:59,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 245 flow. Second operand has 7 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have 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:48:59,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:59,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 300 [2023-11-06 22:48:59,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:49:00,135 INFO L124 PetriNetUnfolderBase]: 2616/4576 cut-off events. [2023-11-06 22:49:00,135 INFO L125 PetriNetUnfolderBase]: For 6672/6770 co-relation queries the response was YES. [2023-11-06 22:49:00,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16373 conditions, 4576 events. 2616/4576 cut-off events. For 6672/6770 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 31125 event pairs, 317 based on Foata normal form. 69/4598 useless extension candidates. Maximal degree in co-relation 16357. Up to 1740 conditions per place. [2023-11-06 22:49:00,173 INFO L140 encePairwiseOnDemand]: 294/300 looper letters, 91 selfloop transitions, 10 changer transitions 0/107 dead transitions. [2023-11-06 22:49:00,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 107 transitions, 731 flow [2023-11-06 22:49:00,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:49:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:49:00,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 975 transitions. [2023-11-06 22:49:00,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2023-11-06 22:49:00,179 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 975 transitions. [2023-11-06 22:49:00,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 975 transitions. [2023-11-06 22:49:00,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:49:00,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 975 transitions. [2023-11-06 22:49:00,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.28571428571428) internal successors, (975), 7 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have 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:49:00,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have 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:49:00,188 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have 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:49:00,188 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 245 flow. Second operand 7 states and 975 transitions. [2023-11-06 22:49:00,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 107 transitions, 731 flow [2023-11-06 22:49:00,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 107 transitions, 727 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:49:00,417 INFO L231 Difference]: Finished difference. Result has 72 places, 53 transitions, 285 flow [2023-11-06 22:49:00,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=285, PETRI_PLACES=72, PETRI_TRANSITIONS=53} [2023-11-06 22:49:00,418 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2023-11-06 22:49:00,418 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 53 transitions, 285 flow [2023-11-06 22:49:00,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have 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:49:00,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:00,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:00,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:49:00,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:49:00,632 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:49:00,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:00,632 INFO L85 PathProgramCache]: Analyzing trace with hash 108259846, now seen corresponding path program 6 times [2023-11-06 22:49:00,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:49:00,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772974215] [2023-11-06 22:49:00,633 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:49:00,633 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:49:00,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:49:00,634 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:49:00,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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 (13)] Waiting until timeout for monitored process [2023-11-06 22:49:00,802 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-11-06 22:49:00,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:49:00,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:00,969 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:49:00,969 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:49:00,970 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:49:00,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:49:00,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:49:00,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:49:00,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:49:00,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:49:00,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:49:00,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:49:00,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:49:00,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:49:00,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:49:00,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:49:00,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:49:00,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:49:00,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:49:00,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:49:00,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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 (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:01,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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:49:01,194 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:01,200 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:49:01,200 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:49:01,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:49:01 BasicIcfg [2023-11-06 22:49:01,324 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:49:01,325 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:49:01,325 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:49:01,325 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:49:01,326 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:35" (3/4) ... [2023-11-06 22:49:01,330 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:49:01,331 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:49:01,332 INFO L158 Benchmark]: Toolchain (without parser) took 27968.82ms. Allocated memory was 69.2MB in the beginning and 662.7MB in the end (delta: 593.5MB). Free memory was 44.1MB in the beginning and 496.2MB in the end (delta: -452.1MB). Peak memory consumption was 143.2MB. Max. memory is 16.1GB. [2023-11-06 22:49:01,332 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 69.2MB. Free memory is still 44.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:49:01,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 672.60ms. Allocated memory was 69.2MB in the beginning and 98.6MB in the end (delta: 29.4MB). Free memory was 43.9MB in the beginning and 65.8MB in the end (delta: -21.9MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2023-11-06 22:49:01,333 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.06ms. Allocated memory is still 98.6MB. Free memory was 65.8MB in the beginning and 62.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:49:01,334 INFO L158 Benchmark]: Boogie Preprocessor took 84.07ms. Allocated memory is still 98.6MB. Free memory was 62.9MB in the beginning and 61.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:49:01,334 INFO L158 Benchmark]: RCFGBuilder took 949.19ms. Allocated memory is still 98.6MB. Free memory was 61.0MB in the beginning and 62.0MB in the end (delta: -1.1MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2023-11-06 22:49:01,336 INFO L158 Benchmark]: TraceAbstraction took 26139.00ms. Allocated memory was 98.6MB in the beginning and 662.7MB in the end (delta: 564.1MB). Free memory was 61.4MB in the beginning and 497.2MB in the end (delta: -435.8MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. [2023-11-06 22:49:01,336 INFO L158 Benchmark]: Witness Printer took 6.46ms. Allocated memory is still 662.7MB. Free memory was 497.2MB in the beginning and 496.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:49:01,339 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 69.2MB. Free memory is still 44.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 672.60ms. Allocated memory was 69.2MB in the beginning and 98.6MB in the end (delta: 29.4MB). Free memory was 43.9MB in the beginning and 65.8MB in the end (delta: -21.9MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.06ms. Allocated memory is still 98.6MB. Free memory was 65.8MB in the beginning and 62.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.07ms. Allocated memory is still 98.6MB. Free memory was 62.9MB in the beginning and 61.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 949.19ms. Allocated memory is still 98.6MB. Free memory was 61.0MB in the beginning and 62.0MB in the end (delta: -1.1MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * TraceAbstraction took 26139.00ms. Allocated memory was 98.6MB in the beginning and 662.7MB in the end (delta: 564.1MB). Free memory was 61.4MB in the beginning and 497.2MB in the end (delta: -435.8MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. * Witness Printer took 6.46ms. Allocated memory is still 662.7MB. Free memory was 497.2MB in the beginning and 496.2MB in the end (delta: 1.0MB). 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: 10.7s, 157 PlacesBefore, 52 PlacesAfterwards, 147 TransitionsBefore, 40 TransitionsAfterwards, 3842 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 149 TotalNumberOfCompositions, 10127 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4925, independent: 4693, independent conditional: 0, independent unconditional: 4693, dependent: 232, dependent conditional: 0, dependent unconditional: 232, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2086, independent: 2033, independent conditional: 0, independent unconditional: 2033, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4925, independent: 2660, independent conditional: 0, independent unconditional: 2660, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 2086, unknown conditional: 0, unknown unconditional: 2086] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 166, Positive conditional cache size: 0, Positive unconditional cache size: 166, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L859] 0 pthread_t t605; [L860] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t605, ((void *)0), P0, ((void *)0))=0, t605={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L861] 0 pthread_t t606; [L862] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t606, ((void *)0), P1, ((void *)0))=1, t605={11:0}, t606={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L863] 0 pthread_t t607; [L864] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t607, ((void *)0), P2, ((void *)0))=2, t605={11:0}, t606={15:0}, t607={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L865] 0 pthread_t t608; [L866] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t608, ((void *)0), P3, ((void *)0))=3, t605={11:0}, t606={15:0}, t607={7:0}, t608={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 y$w_buff1 = y$w_buff0 [L799] 3 y$w_buff0 = 1 [L800] 3 y$w_buff1_used = y$w_buff0_used [L801] 3 y$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L803] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L804] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L805] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L806] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L807] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L808] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L828] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L834] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L770] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 y$flush_delayed = weak$$choice2 [L776] 2 y$mem_tmp = y [L777] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L778] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = y [L785] 2 y = y$flush_delayed ? y$mem_tmp : y [L786] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L814] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L837] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L838] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L839] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L840] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L841] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L873] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L874] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L875] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L876] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t605={11:0}, t606={15:0}, t607={7:0}, t608={-2147483637:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L881] 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", "mix023_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={8:6}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - 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: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 860]: 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: 866]: 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: 862]: 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, 186 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: 25.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 446 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 376 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1808 IncrementalHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 14 mSDtfsCounter, 1808 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=285occurred in iteration=11, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 885 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1635 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:49:01,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d637f30e-3ea7-4f31-ae49-854970abbd64/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