./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:38:58,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:38:58,173 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-13 23:38:58,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:38:58,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:38:58,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:38:58,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:38:58,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:38:58,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:38:58,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:38:58,239 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:38:58,240 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:38:58,240 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:38:58,240 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-13 23:38:58,241 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:38:58,241 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:38:58,241 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-13 23:38:58,243 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-13 23:38:58,243 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:38:58,244 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-13 23:38:58,244 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-13 23:38:58,244 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-13 23:38:58,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 23:38:58,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 23:38:58,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:38:58,245 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:38:58,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:38:58,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:38:58,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:38:58,245 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 23:38:58,245 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 23:38:58,245 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 23:38:58,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:38:58,246 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 23:38:58,246 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:38:58,246 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 23:38:58,246 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:38:58,246 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:38:58,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:38:58,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:38:58,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:38:58,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:38:58,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:38:58,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:38:58,249 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-13 23:38:58,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:38:58,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:38:58,249 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:38:58,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 23:38:58,250 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 [2024-11-13 23:38:58,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:38:58,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:38:58,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:38:58,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:38:58,655 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:38:58,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i Unable to find full path for "g++" [2024-11-13 23:39:00,959 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:39:01,398 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:39:01,399 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i [2024-11-13 23:39:01,419 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/data/eb5998c4d/7f45686e73a848c8901b253280a5aee8/FLAG24cbd21ae [2024-11-13 23:39:01,450 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/data/eb5998c4d/7f45686e73a848c8901b253280a5aee8 [2024-11-13 23:39:01,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:39:01,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:39:01,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:39:01,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:39:01,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:39:01,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:39:01" (1/1) ... [2024-11-13 23:39:01,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2cd054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:39:01, skipping insertion in model container [2024-11-13 23:39:01,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:39:01" (1/1) ... [2024-11-13 23:39:01,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:39:02,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:39:02,063 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:39:02,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:39:02,238 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:39:02,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:39:02 WrapperNode [2024-11-13 23:39:02,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:39:02,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:39:02,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:39:02,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:39:02,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:39:02" (1/1) ... [2024-11-13 23:39:02,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:39:02" (1/1) ... [2024-11-13 23:39:02,320 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 152 [2024-11-13 23:39:02,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:39:02,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:39:02,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:39:02,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:39:02,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:39:02" (1/1) ... [2024-11-13 23:39:02,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:39:02" (1/1) ... [2024-11-13 23:39:02,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:39:02" (1/1) ... [2024-11-13 23:39:02,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:39:02" (1/1) ... [2024-11-13 23:39:02,355 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:39:02" (1/1) ... [2024-11-13 23:39:02,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:39:02" (1/1) ... [2024-11-13 23:39:02,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:39:02" (1/1) ... [2024-11-13 23:39:02,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:39:02" (1/1) ... [2024-11-13 23:39:02,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:39:02,369 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:39:02,370 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:39:02,370 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:39:02,371 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:39:02" (1/1) ... [2024-11-13 23:39:02,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:39:02,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:39:02,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:39:02,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:39:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 23:39:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:39:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 23:39:02,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 23:39:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 23:39:02,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 23:39:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 23:39:02,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 23:39:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-13 23:39:02,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-13 23:39:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:39:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 23:39:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:39:02,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:39:02,454 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 23:39:02,722 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:39:02,725 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:39:03,294 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 23:39:03,295 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:39:03,687 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:39:03,687 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 23:39:03,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:39:03 BoogieIcfgContainer [2024-11-13 23:39:03,688 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:39:03,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:39:03,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:39:03,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:39:03,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:39:01" (1/3) ... [2024-11-13 23:39:03,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29851faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:39:03, skipping insertion in model container [2024-11-13 23:39:03,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:39:02" (2/3) ... [2024-11-13 23:39:03,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29851faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:39:03, skipping insertion in model container [2024-11-13 23:39:03,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:39:03" (3/3) ... [2024-11-13 23:39:03,705 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2024-11-13 23:39:03,734 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:39:03,738 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix037_tso.oepc.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 23:39:03,738 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 23:39:03,852 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 23:39:03,911 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 55 transitions, 126 flow [2024-11-13 23:39:07,815 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 51627 states, 51622 states have (on average 4.523478361938708) internal successors, (233511), 51626 states have internal predecessors, (233511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:07,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:39:07,887 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@7d9152bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:39:07,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-13 23:39:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 51627 states, 51622 states have (on average 4.523478361938708) internal successors, (233511), 51626 states have internal predecessors, (233511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 23:39:08,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:08,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 23:39:08,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:39:08,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash -233623247, now seen corresponding path program 1 times [2024-11-13 23:39:08,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:08,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695173112] [2024-11-13 23:39:08,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:08,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:39:08,933 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:08,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695173112] [2024-11-13 23:39:08,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695173112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:08,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:39:08,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 23:39:08,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26946900] [2024-11-13 23:39:08,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:08,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:39:08,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:08,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:39:08,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:39:09,063 INFO L87 Difference]: Start difference. First operand has 51627 states, 51622 states have (on average 4.523478361938708) internal successors, (233511), 51626 states have internal predecessors, (233511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:11,409 INFO L93 Difference]: Finished difference Result 61770 states and 277114 transitions. [2024-11-13 23:39:11,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:39:11,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-13 23:39:11,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:12,338 INFO L225 Difference]: With dead ends: 61770 [2024-11-13 23:39:12,339 INFO L226 Difference]: Without dead ends: 40931 [2024-11-13 23:39:12,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:39:12,416 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:12,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 43 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:39:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40931 states. [2024-11-13 23:39:15,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40931 to 40931. [2024-11-13 23:39:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40931 states, 40929 states have (on average 4.364973490678981) internal successors, (178654), 40930 states have internal predecessors, (178654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40931 states to 40931 states and 178654 transitions. [2024-11-13 23:39:16,616 INFO L78 Accepts]: Start accepts. Automaton has 40931 states and 178654 transitions. Word has length 6 [2024-11-13 23:39:16,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:16,616 INFO L471 AbstractCegarLoop]: Abstraction has 40931 states and 178654 transitions. [2024-11-13 23:39:16,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 40931 states and 178654 transitions. [2024-11-13 23:39:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 23:39:16,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:16,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:39:16,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 23:39:16,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:39:16,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:16,659 INFO L85 PathProgramCache]: Analyzing trace with hash 47825896, now seen corresponding path program 1 times [2024-11-13 23:39:16,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:16,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159948501] [2024-11-13 23:39:16,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:16,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:39:16,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:16,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159948501] [2024-11-13 23:39:16,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159948501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:16,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:39:16,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 23:39:16,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601850789] [2024-11-13 23:39:16,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:16,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:39:16,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:16,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:39:16,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:39:16,912 INFO L87 Difference]: Start difference. First operand 40931 states and 178654 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:18,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:18,138 INFO L93 Difference]: Finished difference Result 40931 states and 178654 transitions. [2024-11-13 23:39:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:39:18,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-13 23:39:18,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:18,575 INFO L225 Difference]: With dead ends: 40931 [2024-11-13 23:39:18,576 INFO L226 Difference]: Without dead ends: 31670 [2024-11-13 23:39:18,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:39:18,604 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:18,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 21 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:39:18,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31670 states. [2024-11-13 23:39:20,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31670 to 31670. [2024-11-13 23:39:20,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31670 states, 31669 states have (on average 4.336954119170167) internal successors, (137347), 31669 states have internal predecessors, (137347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31670 states to 31670 states and 137347 transitions. [2024-11-13 23:39:20,808 INFO L78 Accepts]: Start accepts. Automaton has 31670 states and 137347 transitions. Word has length 17 [2024-11-13 23:39:20,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:20,809 INFO L471 AbstractCegarLoop]: Abstraction has 31670 states and 137347 transitions. [2024-11-13 23:39:20,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:20,809 INFO L276 IsEmpty]: Start isEmpty. Operand 31670 states and 137347 transitions. [2024-11-13 23:39:20,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 23:39:20,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:20,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:39:20,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 23:39:20,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:39:20,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:20,839 INFO L85 PathProgramCache]: Analyzing trace with hash 47827154, now seen corresponding path program 1 times [2024-11-13 23:39:20,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:20,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471419750] [2024-11-13 23:39:20,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:20,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:39:22,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:22,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471419750] [2024-11-13 23:39:22,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471419750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:22,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:39:22,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:39:22,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602247001] [2024-11-13 23:39:22,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:22,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:39:22,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:22,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:39:22,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:39:22,544 INFO L87 Difference]: Start difference. First operand 31670 states and 137347 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:23,683 INFO L93 Difference]: Finished difference Result 40245 states and 173117 transitions. [2024-11-13 23:39:23,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:39:23,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-13 23:39:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:24,492 INFO L225 Difference]: With dead ends: 40245 [2024-11-13 23:39:24,493 INFO L226 Difference]: Without dead ends: 24810 [2024-11-13 23:39:24,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:39:24,531 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 114 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:24,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 183 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 23:39:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24810 states. [2024-11-13 23:39:25,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24810 to 24810. [2024-11-13 23:39:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24810 states, 24809 states have (on average 4.272118989076545) internal successors, (105987), 24809 states have internal predecessors, (105987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24810 states to 24810 states and 105987 transitions. [2024-11-13 23:39:26,122 INFO L78 Accepts]: Start accepts. Automaton has 24810 states and 105987 transitions. Word has length 17 [2024-11-13 23:39:26,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:26,123 INFO L471 AbstractCegarLoop]: Abstraction has 24810 states and 105987 transitions. [2024-11-13 23:39:26,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 24810 states and 105987 transitions. [2024-11-13 23:39:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 23:39:26,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:26,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:39:26,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 23:39:26,161 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:39:26,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1548739312, now seen corresponding path program 1 times [2024-11-13 23:39:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:26,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226376269] [2024-11-13 23:39:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:26,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:39:27,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:27,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226376269] [2024-11-13 23:39:27,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226376269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:27,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:39:27,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:39:27,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74378459] [2024-11-13 23:39:27,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:27,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:39:27,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:27,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:39:27,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:39:27,169 INFO L87 Difference]: Start difference. First operand 24810 states and 105987 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:28,078 INFO L93 Difference]: Finished difference Result 32335 states and 137077 transitions. [2024-11-13 23:39:28,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 23:39:28,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-13 23:39:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:28,683 INFO L225 Difference]: With dead ends: 32335 [2024-11-13 23:39:28,684 INFO L226 Difference]: Without dead ends: 23760 [2024-11-13 23:39:28,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:39:28,708 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 104 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:28,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 197 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 23:39:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23760 states. [2024-11-13 23:39:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23760 to 23760. [2024-11-13 23:39:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23760 states, 23759 states have (on average 4.2551033292647) internal successors, (101097), 23759 states have internal predecessors, (101097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23760 states to 23760 states and 101097 transitions. [2024-11-13 23:39:30,011 INFO L78 Accepts]: Start accepts. Automaton has 23760 states and 101097 transitions. Word has length 21 [2024-11-13 23:39:30,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:30,012 INFO L471 AbstractCegarLoop]: Abstraction has 23760 states and 101097 transitions. [2024-11-13 23:39:30,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:30,013 INFO L276 IsEmpty]: Start isEmpty. Operand 23760 states and 101097 transitions. [2024-11-13 23:39:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 23:39:30,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:30,115 INFO L215 NwaCegarLoop]: 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] [2024-11-13 23:39:30,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 23:39:30,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:39:30,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:30,121 INFO L85 PathProgramCache]: Analyzing trace with hash 715187374, now seen corresponding path program 1 times [2024-11-13 23:39:30,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:30,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462974479] [2024-11-13 23:39:30,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:30,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:39:30,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:30,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462974479] [2024-11-13 23:39:30,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462974479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:30,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:39:30,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:39:30,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539852021] [2024-11-13 23:39:30,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:30,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:39:30,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:30,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:39:30,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:39:30,974 INFO L87 Difference]: Start difference. First operand 23760 states and 101097 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:31,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:31,549 INFO L93 Difference]: Finished difference Result 36496 states and 152537 transitions. [2024-11-13 23:39:31,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:39:31,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-13 23:39:31,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:31,749 INFO L225 Difference]: With dead ends: 36496 [2024-11-13 23:39:31,750 INFO L226 Difference]: Without dead ends: 19710 [2024-11-13 23:39:31,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:39:31,799 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 76 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:31,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 49 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:39:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19710 states. [2024-11-13 23:39:32,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19710 to 19710. [2024-11-13 23:39:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19710 states, 19709 states have (on average 4.102034603480643) internal successors, (80847), 19709 states have internal predecessors, (80847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19710 states to 19710 states and 80847 transitions. [2024-11-13 23:39:33,186 INFO L78 Accepts]: Start accepts. Automaton has 19710 states and 80847 transitions. Word has length 23 [2024-11-13 23:39:33,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:33,188 INFO L471 AbstractCegarLoop]: Abstraction has 19710 states and 80847 transitions. [2024-11-13 23:39:33,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:33,188 INFO L276 IsEmpty]: Start isEmpty. Operand 19710 states and 80847 transitions. [2024-11-13 23:39:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 23:39:33,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:33,228 INFO L215 NwaCegarLoop]: 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] [2024-11-13 23:39:33,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 23:39:33,229 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:39:33,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:33,230 INFO L85 PathProgramCache]: Analyzing trace with hash -643297751, now seen corresponding path program 1 times [2024-11-13 23:39:33,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:33,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672908492] [2024-11-13 23:39:33,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:33,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:39:33,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:33,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672908492] [2024-11-13 23:39:33,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672908492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:33,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:39:33,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:39:33,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761110418] [2024-11-13 23:39:33,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:33,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:39:33,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:33,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:39:33,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:39:33,676 INFO L87 Difference]: Start difference. First operand 19710 states and 80847 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:34,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:34,244 INFO L93 Difference]: Finished difference Result 25526 states and 102447 transitions. [2024-11-13 23:39:34,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:39:34,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-13 23:39:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:34,405 INFO L225 Difference]: With dead ends: 25526 [2024-11-13 23:39:34,405 INFO L226 Difference]: Without dead ends: 12790 [2024-11-13 23:39:34,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:39:34,435 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 134 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:34,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 64 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:39:34,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12790 states. [2024-11-13 23:39:35,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12790 to 12790. [2024-11-13 23:39:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12790 states, 12789 states have (on average 3.8866995073891624) internal successors, (49707), 12789 states have internal predecessors, (49707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12790 states to 12790 states and 49707 transitions. [2024-11-13 23:39:35,363 INFO L78 Accepts]: Start accepts. Automaton has 12790 states and 49707 transitions. Word has length 26 [2024-11-13 23:39:35,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:35,364 INFO L471 AbstractCegarLoop]: Abstraction has 12790 states and 49707 transitions. [2024-11-13 23:39:35,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:35,364 INFO L276 IsEmpty]: Start isEmpty. Operand 12790 states and 49707 transitions. [2024-11-13 23:39:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 23:39:35,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:35,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:39:35,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 23:39:35,391 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:39:35,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:35,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1570810386, now seen corresponding path program 1 times [2024-11-13 23:39:35,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:35,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496158784] [2024-11-13 23:39:35,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:35,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:39:35,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:35,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496158784] [2024-11-13 23:39:35,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496158784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:35,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:39:35,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:39:35,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261352379] [2024-11-13 23:39:35,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:35,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:39:35,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:35,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:39:35,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:39:35,833 INFO L87 Difference]: Start difference. First operand 12790 states and 49707 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:36,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:36,321 INFO L93 Difference]: Finished difference Result 14166 states and 54267 transitions. [2024-11-13 23:39:36,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:39:36,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-13 23:39:36,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:36,434 INFO L225 Difference]: With dead ends: 14166 [2024-11-13 23:39:36,434 INFO L226 Difference]: Without dead ends: 8350 [2024-11-13 23:39:36,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:39:36,452 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 214 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:36,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 75 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:39:36,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8350 states. [2024-11-13 23:39:36,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8350 to 8350. [2024-11-13 23:39:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8350 states, 8349 states have (on average 3.8264462809917354) internal successors, (31947), 8349 states have internal predecessors, (31947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8350 states to 8350 states and 31947 transitions. [2024-11-13 23:39:36,746 INFO L78 Accepts]: Start accepts. Automaton has 8350 states and 31947 transitions. Word has length 29 [2024-11-13 23:39:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:36,748 INFO L471 AbstractCegarLoop]: Abstraction has 8350 states and 31947 transitions. [2024-11-13 23:39:36,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:36,749 INFO L276 IsEmpty]: Start isEmpty. Operand 8350 states and 31947 transitions. [2024-11-13 23:39:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 23:39:36,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:36,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:39:36,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 23:39:36,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:39:36,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:36,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1440079622, now seen corresponding path program 1 times [2024-11-13 23:39:36,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:36,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426282089] [2024-11-13 23:39:36,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:36,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:39:38,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:38,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426282089] [2024-11-13 23:39:38,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426282089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:38,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:39:38,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 23:39:38,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827785099] [2024-11-13 23:39:38,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:38,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:39:38,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:38,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:39:38,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:39:38,098 INFO L87 Difference]: Start difference. First operand 8350 states and 31947 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:39,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:39,063 INFO L93 Difference]: Finished difference Result 12390 states and 46833 transitions. [2024-11-13 23:39:39,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 23:39:39,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-13 23:39:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:39,154 INFO L225 Difference]: With dead ends: 12390 [2024-11-13 23:39:39,155 INFO L226 Difference]: Without dead ends: 8510 [2024-11-13 23:39:39,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:39:39,168 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 122 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:39,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 228 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 23:39:39,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8510 states. [2024-11-13 23:39:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8510 to 8350. [2024-11-13 23:39:39,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8350 states, 8349 states have (on average 3.7414061564259193) internal successors, (31237), 8349 states have internal predecessors, (31237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8350 states to 8350 states and 31237 transitions. [2024-11-13 23:39:39,682 INFO L78 Accepts]: Start accepts. Automaton has 8350 states and 31237 transitions. Word has length 34 [2024-11-13 23:39:39,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:39,684 INFO L471 AbstractCegarLoop]: Abstraction has 8350 states and 31237 transitions. [2024-11-13 23:39:39,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand 8350 states and 31237 transitions. [2024-11-13 23:39:39,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 23:39:39,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:39,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:39:39,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 23:39:39,725 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:39:39,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1431572179, now seen corresponding path program 1 times [2024-11-13 23:39:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:39,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171198062] [2024-11-13 23:39:39,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:39,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:39:41,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:41,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171198062] [2024-11-13 23:39:41,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171198062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:41,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:39:41,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 23:39:41,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063670272] [2024-11-13 23:39:41,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:41,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 23:39:41,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:41,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 23:39:41,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:39:41,820 INFO L87 Difference]: Start difference. First operand 8350 states and 31237 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:43,132 INFO L93 Difference]: Finished difference Result 13202 states and 48519 transitions. [2024-11-13 23:39:43,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 23:39:43,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-13 23:39:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:43,263 INFO L225 Difference]: With dead ends: 13202 [2024-11-13 23:39:43,263 INFO L226 Difference]: Without dead ends: 11576 [2024-11-13 23:39:43,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2024-11-13 23:39:43,275 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 317 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:43,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 284 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 23:39:43,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11576 states. [2024-11-13 23:39:43,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11576 to 9316. [2024-11-13 23:39:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9316 states, 9315 states have (on average 3.7002683843263555) internal successors, (34468), 9315 states have internal predecessors, (34468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9316 states to 9316 states and 34468 transitions. [2024-11-13 23:39:43,945 INFO L78 Accepts]: Start accepts. Automaton has 9316 states and 34468 transitions. Word has length 34 [2024-11-13 23:39:43,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:43,945 INFO L471 AbstractCegarLoop]: Abstraction has 9316 states and 34468 transitions. [2024-11-13 23:39:43,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:43,946 INFO L276 IsEmpty]: Start isEmpty. Operand 9316 states and 34468 transitions. [2024-11-13 23:39:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 23:39:43,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:43,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:39:43,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 23:39:43,983 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:39:43,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash -339654611, now seen corresponding path program 2 times [2024-11-13 23:39:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:43,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054763022] [2024-11-13 23:39:43,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:43,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:39:46,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:46,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054763022] [2024-11-13 23:39:46,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054763022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:46,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:39:46,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 23:39:46,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672839513] [2024-11-13 23:39:46,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:46,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 23:39:46,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:46,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 23:39:46,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:39:46,638 INFO L87 Difference]: Start difference. First operand 9316 states and 34468 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:48,115 INFO L93 Difference]: Finished difference Result 12052 states and 44004 transitions. [2024-11-13 23:39:48,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 23:39:48,115 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-13 23:39:48,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:48,245 INFO L225 Difference]: With dead ends: 12052 [2024-11-13 23:39:48,245 INFO L226 Difference]: Without dead ends: 9564 [2024-11-13 23:39:48,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2024-11-13 23:39:48,258 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 269 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:48,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 382 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 23:39:48,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9564 states. [2024-11-13 23:39:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9564 to 8924. [2024-11-13 23:39:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8924 states, 8923 states have (on average 3.691359408270761) internal successors, (32938), 8923 states have internal predecessors, (32938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8924 states to 8924 states and 32938 transitions. [2024-11-13 23:39:48,801 INFO L78 Accepts]: Start accepts. Automaton has 8924 states and 32938 transitions. Word has length 34 [2024-11-13 23:39:48,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:48,801 INFO L471 AbstractCegarLoop]: Abstraction has 8924 states and 32938 transitions. [2024-11-13 23:39:48,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 8924 states and 32938 transitions. [2024-11-13 23:39:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 23:39:48,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:48,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:39:48,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 23:39:48,830 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:39:48,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:48,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1205336122, now seen corresponding path program 2 times [2024-11-13 23:39:48,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:48,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870106921] [2024-11-13 23:39:48,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:48,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:39:49,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:49,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870106921] [2024-11-13 23:39:49,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870106921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:49,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:39:49,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:39:49,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625299037] [2024-11-13 23:39:49,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:49,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:39:49,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:49,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:39:49,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:39:49,219 INFO L87 Difference]: Start difference. First operand 8924 states and 32938 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:49,651 INFO L93 Difference]: Finished difference Result 9052 states and 33306 transitions. [2024-11-13 23:39:49,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:39:49,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-13 23:39:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:49,763 INFO L225 Difference]: With dead ends: 9052 [2024-11-13 23:39:49,764 INFO L226 Difference]: Without dead ends: 5464 [2024-11-13 23:39:49,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:39:49,780 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 228 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:49,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 58 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:39:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5464 states. [2024-11-13 23:39:49,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5464 to 4504. [2024-11-13 23:39:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4504 states, 4503 states have (on average 3.6768820786142573) internal successors, (16557), 4503 states have internal predecessors, (16557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 16557 transitions. [2024-11-13 23:39:50,028 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 16557 transitions. Word has length 34 [2024-11-13 23:39:50,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:50,028 INFO L471 AbstractCegarLoop]: Abstraction has 4504 states and 16557 transitions. [2024-11-13 23:39:50,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 16557 transitions. [2024-11-13 23:39:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:39:50,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:50,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:39:50,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 23:39:50,045 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:39:50,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:50,047 INFO L85 PathProgramCache]: Analyzing trace with hash -322126013, now seen corresponding path program 1 times [2024-11-13 23:39:50,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:50,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956585271] [2024-11-13 23:39:50,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:50,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:39:53,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:53,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956585271] [2024-11-13 23:39:53,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956585271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:53,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:39:53,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 23:39:53,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401572983] [2024-11-13 23:39:53,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:53,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 23:39:53,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:53,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 23:39:53,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-13 23:39:53,665 INFO L87 Difference]: Start difference. First operand 4504 states and 16557 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:54,479 INFO L93 Difference]: Finished difference Result 6024 states and 21817 transitions. [2024-11-13 23:39:54,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:39:54,480 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-13 23:39:54,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:54,577 INFO L225 Difference]: With dead ends: 6024 [2024-11-13 23:39:54,577 INFO L226 Difference]: Without dead ends: 5554 [2024-11-13 23:39:54,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-13 23:39:54,583 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 126 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:54,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 263 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 23:39:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5554 states. [2024-11-13 23:39:54,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5554 to 4450. [2024-11-13 23:39:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4450 states, 4449 states have (on average 3.6790289952798383) internal successors, (16368), 4449 states have internal predecessors, (16368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4450 states to 4450 states and 16368 transitions. [2024-11-13 23:39:54,831 INFO L78 Accepts]: Start accepts. Automaton has 4450 states and 16368 transitions. Word has length 39 [2024-11-13 23:39:54,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:54,833 INFO L471 AbstractCegarLoop]: Abstraction has 4450 states and 16368 transitions. [2024-11-13 23:39:54,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4450 states and 16368 transitions. [2024-11-13 23:39:54,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:39:54,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:54,847 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:39:54,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 23:39:54,848 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:39:54,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:54,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1677775269, now seen corresponding path program 2 times [2024-11-13 23:39:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:54,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787191235] [2024-11-13 23:39:54,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:39:58,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:58,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787191235] [2024-11-13 23:39:58,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787191235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:58,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:39:58,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 23:39:58,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249788487] [2024-11-13 23:39:58,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:58,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 23:39:58,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:58,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 23:39:58,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 23:39:58,759 INFO L87 Difference]: Start difference. First operand 4450 states and 16368 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:39:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:59,813 INFO L93 Difference]: Finished difference Result 5778 states and 20924 transitions. [2024-11-13 23:39:59,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 23:39:59,813 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-13 23:39:59,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:59,881 INFO L225 Difference]: With dead ends: 5778 [2024-11-13 23:39:59,881 INFO L226 Difference]: Without dead ends: 4144 [2024-11-13 23:39:59,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-13 23:39:59,885 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 152 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:59,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 477 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 23:39:59,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4144 states. [2024-11-13 23:39:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4144 to 4144. [2024-11-13 23:39:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4143 states have (on average 3.681390296886314) internal successors, (15252), 4143 states have internal predecessors, (15252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:00,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 15252 transitions. [2024-11-13 23:40:00,095 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 15252 transitions. Word has length 39 [2024-11-13 23:40:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:00,095 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 15252 transitions. [2024-11-13 23:40:00,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:00,096 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 15252 transitions. [2024-11-13 23:40:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:40:00,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:00,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:00,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 23:40:00,110 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:40:00,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:00,110 INFO L85 PathProgramCache]: Analyzing trace with hash 492906977, now seen corresponding path program 3 times [2024-11-13 23:40:00,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:40:00,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975803836] [2024-11-13 23:40:00,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:00,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:40:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:40:00,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 23:40:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:40:00,499 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-13 23:40:00,499 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 23:40:00,500 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-13 23:40:00,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-13 23:40:00,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-13 23:40:00,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-13 23:40:00,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-13 23:40:00,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-13 23:40:00,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-13 23:40:00,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-13 23:40:00,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 23:40:00,512 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:00,661 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 23:40:00,661 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 23:40:00,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 11:40:00 BasicIcfg [2024-11-13 23:40:00,666 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 23:40:00,666 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 23:40:00,667 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 23:40:00,667 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 23:40:00,668 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:39:03" (3/4) ... [2024-11-13 23:40:00,670 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 23:40:00,671 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 23:40:00,673 INFO L158 Benchmark]: Toolchain (without parser) took 59216.58ms. Allocated memory was 117.4MB in the beginning and 11.3GB in the end (delta: 11.2GB). Free memory was 90.9MB in the beginning and 9.5GB in the end (delta: -9.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-11-13 23:40:00,673 INFO L158 Benchmark]: CDTParser took 2.09ms. Allocated memory is still 167.8MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:40:00,673 INFO L158 Benchmark]: CACSL2BoogieTranslator took 782.94ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 66.7MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 23:40:00,674 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.05ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 64.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:40:00,674 INFO L158 Benchmark]: Boogie Preprocessor took 46.98ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 62.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:40:00,674 INFO L158 Benchmark]: RCFGBuilder took 1318.73ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 56.1MB in the end (delta: 6.4MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-11-13 23:40:00,675 INFO L158 Benchmark]: TraceAbstraction took 56974.47ms. Allocated memory was 117.4MB in the beginning and 11.3GB in the end (delta: 11.2GB). Free memory was 55.5MB in the beginning and 9.5GB in the end (delta: -9.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-11-13 23:40:00,675 INFO L158 Benchmark]: Witness Printer took 5.25ms. Allocated memory is still 11.3GB. Free memory was 9.5GB in the beginning and 9.5GB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:40:00,677 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.09ms. Allocated memory is still 167.8MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 782.94ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 66.7MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.05ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 64.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.98ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 62.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1318.73ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 56.1MB in the end (delta: 6.4MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * TraceAbstraction took 56974.47ms. Allocated memory was 117.4MB in the beginning and 11.3GB in the end (delta: 11.2GB). Free memory was 55.5MB in the beginning and 9.5GB in the end (delta: -9.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 5.25ms. Allocated memory is still 11.3GB. Free memory was 9.5GB in the beginning and 9.5GB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t993; [L859] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t993=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t994; [L861] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t993=-3, t994=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t995; [L863] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t993=-3, t994=-2, t995=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t996; [L865] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t993=-3, t994=-2, t995=-1, t996=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L824] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L827] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L810] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L757] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993=-3, t994=-2, t995=-1, t996=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993=-3, t994=-2, t995=-1, t996=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993=-3, t994=-2, t995=-1, t996=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix037_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 861]: 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: 859]: 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: 865]: 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, 89 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 56.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.6s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1917 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1917 mSDsluCounter, 2324 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1813 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2597 IncrementalHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 511 mSDtfsCounter, 2597 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51627occurred in iteration=0, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 5124 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 18.0s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 4327 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 [2024-11-13 23:40:00,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:40:04,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:40:04,509 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-13 23:40:04,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:40:04,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:40:04,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:40:04,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:40:04,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:40:04,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:40:04,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:40:04,563 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:40:04,564 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:40:04,564 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:40:04,564 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:40:04,564 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:40:04,564 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:40:04,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 23:40:04,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 23:40:04,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:40:04,566 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:40:04,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:40:04,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:40:04,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:40:04,566 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 23:40:04,566 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 23:40:04,567 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 23:40:04,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:40:04,567 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 23:40:04,567 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 23:40:04,567 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:40:04,568 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 23:40:04,568 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 23:40:04,568 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:40:04,568 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:40:04,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:40:04,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 23:40:04,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:40:04,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:40:04,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:40:04,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:40:04,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:40:04,570 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-13 23:40:04,570 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 23:40:04,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:40:04,570 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:40:04,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 [2024-11-13 23:40:04,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:40:04,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:40:04,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:40:04,993 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:40:04,994 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:40:04,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i Unable to find full path for "g++" [2024-11-13 23:40:07,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:40:07,907 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:40:07,908 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i [2024-11-13 23:40:07,933 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/data/510c81b88/b92f3bc772284a178e0869e512509436/FLAG2d00ae5d5 [2024-11-13 23:40:07,960 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/data/510c81b88/b92f3bc772284a178e0869e512509436 [2024-11-13 23:40:07,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:40:07,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:40:07,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:40:07,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:40:07,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:40:07,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:40:07" (1/1) ... [2024-11-13 23:40:07,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@780adf03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:07, skipping insertion in model container [2024-11-13 23:40:07,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:40:07" (1/1) ... [2024-11-13 23:40:08,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:40:08,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:40:08,620 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:40:08,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:40:08,795 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:40:08,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:08 WrapperNode [2024-11-13 23:40:08,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:40:08,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:40:08,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:40:08,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:40:08,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:08" (1/1) ... [2024-11-13 23:40:08,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:08" (1/1) ... [2024-11-13 23:40:08,880 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 153 [2024-11-13 23:40:08,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:40:08,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:40:08,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:40:08,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:40:08,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:08" (1/1) ... [2024-11-13 23:40:08,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:08" (1/1) ... [2024-11-13 23:40:08,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:08" (1/1) ... [2024-11-13 23:40:08,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:08" (1/1) ... [2024-11-13 23:40:08,917 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:08" (1/1) ... [2024-11-13 23:40:08,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:08" (1/1) ... [2024-11-13 23:40:08,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:08" (1/1) ... [2024-11-13 23:40:08,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:08" (1/1) ... [2024-11-13 23:40:08,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:40:08,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:40:08,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:40:08,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:40:08,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:08" (1/1) ... [2024-11-13 23:40:08,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:40:08,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:40:09,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:40:09,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:40:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 23:40:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:40:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-13 23:40:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 23:40:09,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 23:40:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 23:40:09,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 23:40:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 23:40:09,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 23:40:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-13 23:40:09,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-13 23:40:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 23:40:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:40:09,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:40:09,043 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 23:40:09,314 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:40:09,316 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:40:09,980 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 23:40:09,980 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:40:10,415 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:40:10,416 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 23:40:10,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:40:10 BoogieIcfgContainer [2024-11-13 23:40:10,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:40:10,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:40:10,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:40:10,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:40:10,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:40:07" (1/3) ... [2024-11-13 23:40:10,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31453427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:40:10, skipping insertion in model container [2024-11-13 23:40:10,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:08" (2/3) ... [2024-11-13 23:40:10,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31453427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:40:10, skipping insertion in model container [2024-11-13 23:40:10,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:40:10" (3/3) ... [2024-11-13 23:40:10,428 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2024-11-13 23:40:10,449 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:40:10,451 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix037_tso.oepc.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 23:40:10,451 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 23:40:10,567 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 23:40:10,610 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 55 transitions, 126 flow [2024-11-13 23:40:14,363 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 51627 states, 51622 states have (on average 4.523478361938708) internal successors, (233511), 51626 states have internal predecessors, (233511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:14,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:40:14,579 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@28f7b78b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:40:14,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-13 23:40:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 51627 states, 51622 states have (on average 4.523478361938708) internal successors, (233511), 51626 states have internal predecessors, (233511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:14,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 23:40:14,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:14,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 23:40:14,713 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:40:14,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:14,722 INFO L85 PathProgramCache]: Analyzing trace with hash -174456335, now seen corresponding path program 1 times [2024-11-13 23:40:14,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:14,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500770034] [2024-11-13 23:40:14,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:14,739 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 [2024-11-13 23:40:14,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:14,746 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-13 23:40:14,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:14,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 23:40:14,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:40:14,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:14,972 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:14,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500770034] [2024-11-13 23:40:14,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500770034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:14,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:14,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 23:40:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431209158] [2024-11-13 23:40:14,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:14,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:40:14,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:15,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:40:15,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:40:15,109 INFO L87 Difference]: Start difference. First operand has 51627 states, 51622 states have (on average 4.523478361938708) internal successors, (233511), 51626 states have internal predecessors, (233511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:17,008 INFO L93 Difference]: Finished difference Result 61770 states and 277114 transitions. [2024-11-13 23:40:17,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:40:17,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-13 23:40:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:18,175 INFO L225 Difference]: With dead ends: 61770 [2024-11-13 23:40:18,179 INFO L226 Difference]: Without dead ends: 40931 [2024-11-13 23:40:18,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:40:18,479 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:18,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 43 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:40:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40931 states. [2024-11-13 23:40:20,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40931 to 40931. [2024-11-13 23:40:21,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40931 states, 40929 states have (on average 4.364973490678981) internal successors, (178654), 40930 states have internal predecessors, (178654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40931 states to 40931 states and 178654 transitions. [2024-11-13 23:40:22,206 INFO L78 Accepts]: Start accepts. Automaton has 40931 states and 178654 transitions. Word has length 6 [2024-11-13 23:40:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:22,209 INFO L471 AbstractCegarLoop]: Abstraction has 40931 states and 178654 transitions. [2024-11-13 23:40:22,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 40931 states and 178654 transitions. [2024-11-13 23:40:22,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 23:40:22,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:22,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:22,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Ended with exit code 0 [2024-11-13 23:40:22,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:40:22,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:40:22,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1126679018, now seen corresponding path program 1 times [2024-11-13 23:40:22,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:22,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163497718] [2024-11-13 23:40:22,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:22,446 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 [2024-11-13 23:40:22,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:22,451 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-13 23:40:22,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:22,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 23:40:22,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:40:22,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:22,705 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:22,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163497718] [2024-11-13 23:40:22,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163497718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:22,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:22,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:40:22,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256479069] [2024-11-13 23:40:22,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:22,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:40:22,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:22,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:40:22,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:40:22,709 INFO L87 Difference]: Start difference. First operand 40931 states and 178654 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:24,331 INFO L93 Difference]: Finished difference Result 65263 states and 279776 transitions. [2024-11-13 23:40:24,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:40:24,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-13 23:40:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:24,776 INFO L225 Difference]: With dead ends: 65263 [2024-11-13 23:40:24,778 INFO L226 Difference]: Without dead ends: 31306 [2024-11-13 23:40:24,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:40:24,864 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 82 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:24,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 55 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:40:24,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31306 states. [2024-11-13 23:40:26,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31306 to 31306. [2024-11-13 23:40:26,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31306 states, 31304 states have (on average 4.1697227191413235) internal successors, (130529), 31305 states have internal predecessors, (130529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31306 states to 31306 states and 130529 transitions. [2024-11-13 23:40:27,110 INFO L78 Accepts]: Start accepts. Automaton has 31306 states and 130529 transitions. Word has length 17 [2024-11-13 23:40:27,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:27,111 INFO L471 AbstractCegarLoop]: Abstraction has 31306 states and 130529 transitions. [2024-11-13 23:40:27,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 31306 states and 130529 transitions. [2024-11-13 23:40:27,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:40:27,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:27,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:27,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:27,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:40:27,343 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:40:27,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:27,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2140035757, now seen corresponding path program 1 times [2024-11-13 23:40:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:27,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845284379] [2024-11-13 23:40:27,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:27,345 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 [2024-11-13 23:40:27,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:27,347 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-13 23:40:27,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:27,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 23:40:27,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:40:27,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:27,582 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:27,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845284379] [2024-11-13 23:40:27,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845284379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:27,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:27,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:40:27,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679709983] [2024-11-13 23:40:27,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:27,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:40:27,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:27,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:40:27,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:40:27,586 INFO L87 Difference]: Start difference. First operand 31306 states and 130529 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:28,258 INFO L93 Difference]: Finished difference Result 41338 states and 168601 transitions. [2024-11-13 23:40:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:40:28,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-13 23:40:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:28,444 INFO L225 Difference]: With dead ends: 41338 [2024-11-13 23:40:28,444 INFO L226 Difference]: Without dead ends: 17006 [2024-11-13 23:40:28,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:40:28,499 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 138 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:28,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 85 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:40:28,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17006 states. [2024-11-13 23:40:29,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17006 to 17006. [2024-11-13 23:40:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17006 states, 17004 states have (on average 3.8919665960950365) internal successors, (66179), 17005 states have internal predecessors, (66179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17006 states to 17006 states and 66179 transitions. [2024-11-13 23:40:29,539 INFO L78 Accepts]: Start accepts. Automaton has 17006 states and 66179 transitions. Word has length 22 [2024-11-13 23:40:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:29,540 INFO L471 AbstractCegarLoop]: Abstraction has 17006 states and 66179 transitions. [2024-11-13 23:40:29,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 17006 states and 66179 transitions. [2024-11-13 23:40:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 23:40:29,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:29,575 INFO L215 NwaCegarLoop]: 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] [2024-11-13 23:40:29,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:29,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:40:29,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:40:29,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:29,779 INFO L85 PathProgramCache]: Analyzing trace with hash -973041032, now seen corresponding path program 1 times [2024-11-13 23:40:29,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:29,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784804718] [2024-11-13 23:40:29,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:29,783 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 [2024-11-13 23:40:29,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:29,787 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-13 23:40:29,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:29,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 23:40:29,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:40:30,090 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:30,091 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:30,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784804718] [2024-11-13 23:40:30,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784804718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:30,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:30,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:40:30,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992828427] [2024-11-13 23:40:30,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:30,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:40:30,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:30,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:40:30,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:40:30,094 INFO L87 Difference]: Start difference. First operand 17006 states and 66179 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:30,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:30,615 INFO L93 Difference]: Finished difference Result 19118 states and 73291 transitions. [2024-11-13 23:40:30,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:40:30,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-13 23:40:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:30,727 INFO L225 Difference]: With dead ends: 19118 [2024-11-13 23:40:30,727 INFO L226 Difference]: Without dead ends: 9086 [2024-11-13 23:40:30,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:40:30,752 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 190 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:30,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 154 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:40:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2024-11-13 23:40:31,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 9086. [2024-11-13 23:40:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9086 states, 9084 states have (on average 3.7977763099955966) internal successors, (34499), 9085 states have internal predecessors, (34499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 34499 transitions. [2024-11-13 23:40:31,465 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 34499 transitions. Word has length 27 [2024-11-13 23:40:31,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:31,465 INFO L471 AbstractCegarLoop]: Abstraction has 9086 states and 34499 transitions. [2024-11-13 23:40:31,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:31,466 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 34499 transitions. [2024-11-13 23:40:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 23:40:31,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:31,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:31,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:31,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:40:31,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:40:31,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:31,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1413005982, now seen corresponding path program 1 times [2024-11-13 23:40:31,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:31,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349454582] [2024-11-13 23:40:31,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:31,693 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 [2024-11-13 23:40:31,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:31,695 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-13 23:40:31,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:31,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 23:40:31,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:40:31,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:31,933 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:31,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349454582] [2024-11-13 23:40:31,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349454582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:31,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:31,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:40:31,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998365847] [2024-11-13 23:40:31,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:31,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:40:31,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:31,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:40:31,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:40:31,934 INFO L87 Difference]: Start difference. First operand 9086 states and 34499 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:32,408 INFO L93 Difference]: Finished difference Result 9262 states and 35011 transitions. [2024-11-13 23:40:32,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:40:32,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-13 23:40:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:32,491 INFO L225 Difference]: With dead ends: 9262 [2024-11-13 23:40:32,492 INFO L226 Difference]: Without dead ends: 7150 [2024-11-13 23:40:32,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:40:32,499 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 216 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:32,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 232 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 23:40:32,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7150 states. [2024-11-13 23:40:32,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7150 to 7150. [2024-11-13 23:40:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7150 states, 7148 states have (on average 3.8784275321768327) internal successors, (27723), 7149 states have internal predecessors, (27723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7150 states to 7150 states and 27723 transitions. [2024-11-13 23:40:32,785 INFO L78 Accepts]: Start accepts. Automaton has 7150 states and 27723 transitions. Word has length 32 [2024-11-13 23:40:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:32,786 INFO L471 AbstractCegarLoop]: Abstraction has 7150 states and 27723 transitions. [2024-11-13 23:40:32,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 7150 states and 27723 transitions. [2024-11-13 23:40:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:40:32,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:32,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:32,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Ended with exit code 0 [2024-11-13 23:40:33,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:40:33,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:40:33,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash -831005689, now seen corresponding path program 1 times [2024-11-13 23:40:33,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:33,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420763292] [2024-11-13 23:40:33,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:33,014 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 [2024-11-13 23:40:33,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:33,017 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-13 23:40:33,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:33,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 23:40:33,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:40:33,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:33,286 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:33,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420763292] [2024-11-13 23:40:33,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420763292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:33,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:33,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 23:40:33,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227761912] [2024-11-13 23:40:33,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:33,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:40:33,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:33,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:40:33,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:40:33,288 INFO L87 Difference]: Start difference. First operand 7150 states and 27723 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:33,394 INFO L93 Difference]: Finished difference Result 7150 states and 27723 transitions. [2024-11-13 23:40:33,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:40:33,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-13 23:40:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:33,478 INFO L225 Difference]: With dead ends: 7150 [2024-11-13 23:40:33,479 INFO L226 Difference]: Without dead ends: 7102 [2024-11-13 23:40:33,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:40:33,483 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:33,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 21 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:40:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7102 states. [2024-11-13 23:40:33,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7102 to 7102. [2024-11-13 23:40:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7102 states, 7101 states have (on average 3.8838191803971274) internal successors, (27579), 7101 states have internal predecessors, (27579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7102 states to 7102 states and 27579 transitions. [2024-11-13 23:40:33,998 INFO L78 Accepts]: Start accepts. Automaton has 7102 states and 27579 transitions. Word has length 39 [2024-11-13 23:40:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:33,999 INFO L471 AbstractCegarLoop]: Abstraction has 7102 states and 27579 transitions. [2024-11-13 23:40:33,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:33,999 INFO L276 IsEmpty]: Start isEmpty. Operand 7102 states and 27579 transitions. [2024-11-13 23:40:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:40:34,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:34,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:34,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Ended with exit code 0 [2024-11-13 23:40:34,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:40:34,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:40:34,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash -831004431, now seen corresponding path program 1 times [2024-11-13 23:40:34,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:34,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976852876] [2024-11-13 23:40:34,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:34,226 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 [2024-11-13 23:40:34,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:34,230 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-13 23:40:34,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:34,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 23:40:34,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:34,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:40:34,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:34,601 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:34,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976852876] [2024-11-13 23:40:34,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976852876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:34,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:34,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:40:34,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048783852] [2024-11-13 23:40:34,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:34,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:40:34,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:34,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:40:34,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:40:34,603 INFO L87 Difference]: Start difference. First operand 7102 states and 27579 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:35,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:35,033 INFO L93 Difference]: Finished difference Result 9190 states and 35341 transitions. [2024-11-13 23:40:35,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:40:35,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-13 23:40:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:35,122 INFO L225 Difference]: With dead ends: 9190 [2024-11-13 23:40:35,122 INFO L226 Difference]: Without dead ends: 4082 [2024-11-13 23:40:35,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:40:35,140 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 52 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:35,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 167 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:40:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4082 states. [2024-11-13 23:40:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4082 to 4082. [2024-11-13 23:40:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4082 states, 4081 states have (on average 3.7280078412153883) internal successors, (15214), 4081 states have internal predecessors, (15214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:35,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 15214 transitions. [2024-11-13 23:40:35,340 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 15214 transitions. Word has length 39 [2024-11-13 23:40:35,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:35,340 INFO L471 AbstractCegarLoop]: Abstraction has 4082 states and 15214 transitions. [2024-11-13 23:40:35,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 15214 transitions. [2024-11-13 23:40:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:40:35,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:35,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:35,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:35,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:40:35,554 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:40:35,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:35,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1843869647, now seen corresponding path program 2 times [2024-11-13 23:40:35,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:35,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262723777] [2024-11-13 23:40:35,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 23:40:35,556 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 [2024-11-13 23:40:35,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:35,561 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-13 23:40:35,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:35,727 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 23:40:35,727 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:40:35,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 23:40:35,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:40:35,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:35,900 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:35,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262723777] [2024-11-13 23:40:35,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262723777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:35,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:35,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:40:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733614415] [2024-11-13 23:40:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:35,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:40:35,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:35,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:40:35,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:40:35,902 INFO L87 Difference]: Start difference. First operand 4082 states and 15214 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:36,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:36,250 INFO L93 Difference]: Finished difference Result 6114 states and 22634 transitions. [2024-11-13 23:40:36,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:40:36,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-13 23:40:36,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:36,323 INFO L225 Difference]: With dead ends: 6114 [2024-11-13 23:40:36,323 INFO L226 Difference]: Without dead ends: 2654 [2024-11-13 23:40:36,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:40:36,330 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 60 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:36,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 148 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:40:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2024-11-13 23:40:36,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2654. [2024-11-13 23:40:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2654 states, 2653 states have (on average 3.5793441387108933) internal successors, (9496), 2653 states have internal predecessors, (9496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 9496 transitions. [2024-11-13 23:40:36,467 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 9496 transitions. Word has length 39 [2024-11-13 23:40:36,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:36,467 INFO L471 AbstractCegarLoop]: Abstraction has 2654 states and 9496 transitions. [2024-11-13 23:40:36,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:36,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 9496 transitions. [2024-11-13 23:40:36,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:40:36,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:36,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:36,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-13 23:40:36,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:40:36,681 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:40:36,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:36,681 INFO L85 PathProgramCache]: Analyzing trace with hash 848211697, now seen corresponding path program 3 times [2024-11-13 23:40:36,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:36,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244745263] [2024-11-13 23:40:36,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 23:40:36,682 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 [2024-11-13 23:40:36,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:36,684 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-13 23:40:36,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:36,848 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-13 23:40:36,848 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:40:36,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 23:40:36,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:37,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:40:37,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:37,967 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:37,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244745263] [2024-11-13 23:40:37,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244745263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:37,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:37,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 23:40:37,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293799342] [2024-11-13 23:40:37,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:37,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 23:40:37,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:37,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 23:40:37,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:40:37,970 INFO L87 Difference]: Start difference. First operand 2654 states and 9496 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:38,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:38,308 INFO L93 Difference]: Finished difference Result 3550 states and 12600 transitions. [2024-11-13 23:40:38,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:40:38,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-13 23:40:38,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:38,369 INFO L225 Difference]: With dead ends: 3550 [2024-11-13 23:40:38,369 INFO L226 Difference]: Without dead ends: 2702 [2024-11-13 23:40:38,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:40:38,372 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 65 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:38,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 113 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:40:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2024-11-13 23:40:38,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2222. [2024-11-13 23:40:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2222 states, 2221 states have (on average 3.4813147230977037) internal successors, (7732), 2221 states have internal predecessors, (7732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 7732 transitions. [2024-11-13 23:40:38,525 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 7732 transitions. Word has length 39 [2024-11-13 23:40:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:38,525 INFO L471 AbstractCegarLoop]: Abstraction has 2222 states and 7732 transitions. [2024-11-13 23:40:38,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:38,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 7732 transitions. [2024-11-13 23:40:38,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:40:38,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:38,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:38,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:38,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:40:38,736 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:40:38,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:38,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2014554383, now seen corresponding path program 4 times [2024-11-13 23:40:38,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:38,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644223899] [2024-11-13 23:40:38,737 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 23:40:38,737 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 [2024-11-13 23:40:38,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:38,739 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-13 23:40:38,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:38,894 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 23:40:38,894 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:40:38,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 23:40:38,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:40:39,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:39,249 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:39,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644223899] [2024-11-13 23:40:39,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644223899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:39,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:39,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 23:40:39,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742055312] [2024-11-13 23:40:39,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:39,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 23:40:39,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:39,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 23:40:39,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:40:39,252 INFO L87 Difference]: Start difference. First operand 2222 states and 7732 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:39,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:39,617 INFO L93 Difference]: Finished difference Result 3870 states and 13280 transitions. [2024-11-13 23:40:39,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:40:39,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-13 23:40:39,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:39,686 INFO L225 Difference]: With dead ends: 3870 [2024-11-13 23:40:39,686 INFO L226 Difference]: Without dead ends: 3094 [2024-11-13 23:40:39,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-13 23:40:39,695 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:39,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 204 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:40:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2024-11-13 23:40:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 2048. [2024-11-13 23:40:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 2047 states have (on average 3.509037616023449) internal successors, (7183), 2047 states have internal predecessors, (7183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 7183 transitions. [2024-11-13 23:40:39,830 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 7183 transitions. Word has length 39 [2024-11-13 23:40:39,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:39,831 INFO L471 AbstractCegarLoop]: Abstraction has 2048 states and 7183 transitions. [2024-11-13 23:40:39,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 7183 transitions. [2024-11-13 23:40:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:40:39,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:39,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:39,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:40,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:40:40,041 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:40:40,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash 106610451, now seen corresponding path program 5 times [2024-11-13 23:40:40,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:40,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584286285] [2024-11-13 23:40:40,042 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 23:40:40,042 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 [2024-11-13 23:40:40,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:40,044 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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) [2024-11-13 23:40:40,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:40,194 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 23:40:40,194 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 23:40:40,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 23:40:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:40:40,377 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2024-11-13 23:40:40,377 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 23:40:40,378 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-13 23:40:40,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-13 23:40:40,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-13 23:40:40,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-13 23:40:40,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-13 23:40:40,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-13 23:40:40,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-13 23:40:40,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-13 23:40:40,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-13 23:40:40,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:40:40,589 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:40,691 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 23:40:40,691 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 23:40:40,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 11:40:40 BasicIcfg [2024-11-13 23:40:40,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 23:40:40,695 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 23:40:40,695 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 23:40:40,695 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 23:40:40,696 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:40:10" (3/4) ... [2024-11-13 23:40:40,698 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 23:40:40,699 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 23:40:40,700 INFO L158 Benchmark]: Toolchain (without parser) took 32734.86ms. Allocated memory was 83.9MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 59.1MB in the beginning and 8.0GB in the end (delta: -8.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-13 23:40:40,700 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 83.9MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:40:40,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 828.91ms. Allocated memory is still 83.9MB. Free memory was 58.8MB in the beginning and 34.6MB in the end (delta: 24.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 23:40:40,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.95ms. Allocated memory is still 83.9MB. Free memory was 34.6MB in the beginning and 32.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:40:40,701 INFO L158 Benchmark]: Boogie Preprocessor took 52.61ms. Allocated memory is still 83.9MB. Free memory was 32.0MB in the beginning and 29.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:40:40,701 INFO L158 Benchmark]: RCFGBuilder took 1481.97ms. Allocated memory is still 83.9MB. Free memory was 29.7MB in the beginning and 53.9MB in the end (delta: -24.2MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-11-13 23:40:40,701 INFO L158 Benchmark]: TraceAbstraction took 30274.77ms. Allocated memory was 83.9MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 53.4MB in the beginning and 8.0GB in the end (delta: -8.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-13 23:40:40,702 INFO L158 Benchmark]: Witness Printer took 4.08ms. Allocated memory is still 9.6GB. Free memory was 8.0GB in the beginning and 8.0GB in the end (delta: 75.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:40:40,703 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 83.9MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 828.91ms. Allocated memory is still 83.9MB. Free memory was 58.8MB in the beginning and 34.6MB in the end (delta: 24.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.95ms. Allocated memory is still 83.9MB. Free memory was 34.6MB in the beginning and 32.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.61ms. Allocated memory is still 83.9MB. Free memory was 32.0MB in the beginning and 29.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1481.97ms. Allocated memory is still 83.9MB. Free memory was 29.7MB in the beginning and 53.9MB in the end (delta: -24.2MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * TraceAbstraction took 30274.77ms. Allocated memory was 83.9MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 53.4MB in the beginning and 8.0GB in the end (delta: -8.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 4.08ms. Allocated memory is still 9.6GB. Free memory was 8.0GB in the beginning and 8.0GB in the end (delta: 75.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t993; [L859] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t993=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t994; [L861] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t993=0, t994=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t995; [L863] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t993=0, t994=1, t995=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t996; [L865] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t993=0, t994=1, t995=2, t996=3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L810] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L824] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L827] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L757] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993=0, t994=1, t995=2, t996=3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993=0, t994=1, t995=2, t996=3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993=0, t994=1, t995=2, t996=3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix037_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 861]: 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: 859]: 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: 865]: 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, 89 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 30.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.3s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 909 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 909 mSDsluCounter, 1222 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 889 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1593 IncrementalHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 333 mSDtfsCounter, 1593 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51627occurred in iteration=0, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 1526 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 338 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 1342 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1331 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 23:40:40,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2549c630-bc0a-4dd2-9f86-4ae1f880328d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample